External-Memory Network Analysis Algorithms for Naturally Sparse Graphs

DOI10.1007/978-3-642-23719-5_56zbMath1346.68146arXiv1106.6336OpenAlexW1889221628MaRDI QIDQ3092269

Paweł Pszona, Michael T. Goodrich

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.6336

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On linear algebraic algorithms for the subgraph matching problem and its variants ⋮ Exploiting the formation of maximal cliques in social networks

This page was built for publication: External-Memory Network Analysis Algorithms for Naturally Sparse Graphs