Protean graphs with a variety of ranking schemes
From MaRDI portal
(Redirected from Publication:1040591)
Recommendations
Cites work
- scientific article; zbMATH DE number 5485446 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1405894 (Why is no real title available?)
- A course on the web graph
- Connectivity threshold and recovery time in rank-based models for complex networks
- Growing Protean Graphs
- Handbook of Graph Theory
- Protean Graphs
- Protean Graphs with a Variety of Ranking Schemes
- Rank-based attachment leads to power law graphs
- Sudden emergence of a giant k-core in a random graph
- The diameter of protean graphs
Cited in
(9)- Connectivity threshold and recovery time in rank-based models for complex networks
- Protean Graphs with a Variety of Ranking Schemes
- The domination number of on-line social networks and random geometric graphs
- Rank-based attachment leads to power law graphs
- Ordinal network representation: Representing proximities by graphs
- Scale-free graphs of increasing degree
- Emergence of segregation in evolving social networks
- Protean Graphs
- Beyond rankings: comparing directed acyclic graphs
This page was built for publication: Protean graphs with a variety of ranking schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040591)