Protean Graphs with a Variety of Ranking Schemes

DOI10.1007/978-3-540-85097-7_14zbMath1168.68447OpenAlexW4232143942MaRDI QIDQ5505653

Paweł Prałat

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_14

Mathematics Subject Classification ID

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

Related Items (2)

Connectivity threshold and recovery time in rank-based models for complex networks ⋮ Protean graphs with a variety of ranking schemes

Cites Work

• The diameter of protean graphs
• Sudden emergence of a giant \(k\)-core in a random graph
• Protean Graphs
• Growing Protean Graphs
• Infinite Limits of Copying Models of the Web Graph
• Rank-Based Attachment Leads to Power Law Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Protean Graphs with a Variety of Ranking Schemes