9 citations · 31 across the 11 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2022
Menger's Theorem for Temporal Paths (Not Walks)
Allen Ibiapina, Raul Lopes, Andrea Marino +1
A (directed) temporal graph is a (directed) graph whose edges are available only at specific times during its (discretized) lifetime . In this setting, we ask that walks respect…
cs.DM2021
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
Andrea Marino, Ana Silva
An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits every edge of a graph at least (resp. exactly) once. This notion was first discussed by Leonhard Euler…
cs.DM2018
Listing Maximal Subgraphs in Strongly Accessible Set Systems
Alessio Conte, Roberto Grossi, Andrea Marino +1
Algorithms for listing the subgraphs satisfying a given property (e.g.,being a clique, a cut, a cycle, etc.) fall within the general framework of set systems. A set system (U, F) u…