Andrea Marino

activity

20122023

most citedBUbiNG: Massive Crawling for the Masses

9 citations · 31 across the 11 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DS2020★ 1 cited

Efficient Estimation of Graph Trussness

Alessio Conte, Roberto Grossi, Andrea Marino +1

A $k$ -truss is an edge-induced subgraph $H$ such that each of its edges belongs to at least $k - 2$ triangles of $H$ . This notion has been introduced around ten years ago in social n…

cs.DS2020

Edge-Disjoint Branchings in Temporal Graphs

Victor Campos, Raul Lopes, Andrea Marino +1

A temporal digraph $G$ is a triple $(G, γ, λ)$ where $G$ is a digraph, $γ$ is a function on $V (G)$ that tells us the timestamps when a vertex is active, and $λ$ is a functio…