23 citations · 87 across the 11 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2009★ 4 cited
Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs
Clemence Magnien, Matthieu Latapy, Michel Habib
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network ana…
cs.DS2006★ 8 cited
Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs
Matthieu Latapy
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of the…