Protean graphs with a variety of ranking schemes
From MaRDI portal
Publication:1040591
DOI10.1016/J.TCS.2009.05.009zbMATH Open1192.68485OpenAlexW1500329940MaRDI QIDQ1040591FDOQ1040591
Authors: Paweł Prałat, Jeannette Janssen 
Publication date: 25 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.009
Recommendations
random graphsdegree distributionscale-free networksweb graphspower law graphsprotean graphsdifferential equations method
Cites Work
- Title not available (Why is that?)
- Sudden emergence of a giant \(k\)-core in a random graph
- Handbook of Graph Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Protean Graphs
- Growing Protean Graphs
- Connectivity threshold and recovery time in rank-based models for complex networks
- Rank-based attachment leads to power law graphs
- A course on the web graph
- Protean Graphs with a Variety of Ranking Schemes
- The diameter of protean graphs
Cited In (9)
- Protean Graphs with a Variety of Ranking Schemes
- Connectivity threshold and recovery time in rank-based models for complex networks
- 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)
