Towards a Study of Low-Complexity Graphs

DOI10.1007/978-3-642-02927-1_12MaRDI QIDQ3638029zbMATH OpenOpenAlexFDO

Authors David Steurer, A. Wigderson, Sanjeev Arora

Publication date 14 July 2009

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02927-1_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Low-complexity distributed algorithms on large-scale graphs: a brief review
• Algorithmic complexity of power law networks
• scientific article; zbMATH DE number 6469213
• scientific article; zbMATH DE number 3902710
• Distributed algorithms for random graphs

Cited in

(5)

• Local reduction
• Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
• Local expanders
• Low-complexity distributed algorithms on large-scale graphs: a brief review
• Local reductions

This page was built for publication: Towards a Study of Low-Complexity Graphs

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