192 citations · 529 across the 38 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024★ 1 cited
Reconstruction of geometric random graphs with the Simple algorithm
Clara Stegehuis, Lotte Weedage
Graph reconstruction can efficiently detect the underlying topology of massive networks such as the Internet. Given a query oracle and a set of nodes, the goal is to obtain the edg…
cs.DS2018
Finding induced subgraphs in scale-free inhomogeneous random graphs
Ellen Cardinaels, Johan S. H. van Leeuwaarden, Clara Stegehuis
We study the problem of finding a copy of a specific induced subgraph on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that find…