Drawing power law graphs using a local/global decomposition

DOI10.1007/S00453-006-0160-2zbMATH Open1118.68099OpenAlexW2041462992MaRDI QIDQ879956FDOQ879956

Authors Reid Andersen, Linyuan Lu, Fan Chung

Publication date 10 May 2007

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-006-0160-2

zbMATH Keywords

drawing methods

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Recommendations

• Graph Drawing
• The small world phenomenon in hybrid power law graphs
• Graph Drawing
• A multi-scale algorithm for drawing graphs nicely
• scientific article; zbMATH DE number 2080097

Cited in

(4)

• Graph Drawing
• Untangling hairballs. From 3 to 14 degrees of separation
• A graph-based N-body approximation with application to stochastic neighbor embedding
• Untangling the hairballs of multi-centered, small-world online social media networks

This page was built for publication: Drawing power law graphs using a local/global decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879956)