8 citations · 9 across the 3 of their papers we have counts for
6 papers
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…
Efficient Estimation of Graph Trussness
Alessio Conte, Roberto Grossi, Andrea Marino +1
A -truss is an edge-induced subgraph such that each of its edges belongs to at least triangles of . This notion has been introduced around ten years ago in social n…
Edge-Disjoint Branchings in Temporal Graphs
Victor Campos, Raul Lopes, Andrea Marino +1
A temporal digraph is a triple where is a digraph, is a function on that tells us the timestamps when a vertex is active, and is a functio…
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…
Fast and Simple Computation of Top-k Closeness Centralities
Michele Borassi, Pierluigi Crescenzi, Andrea Marino
Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respe…
Enumerating Cyclic Orientations of a Graph
Alessio Conte, Roberto Grossi, Andrea Marino +1
Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obta…