Growing Protean Graphs
From MaRDI portal
Publication:3622686
Recommendations
Cited in
(19)- Connectivity threshold and recovery time in rank-based models for complex networks
- Evolution in web graphs
- Probabilistic Inductive Classes of Graphs
- Protean Graphs with a Variety of Ranking Schemes
- Crawling on Simple Models of Web Graphs
- The diameter of protean graphs
- Protean graphs with a variety of ranking schemes
- Randomised reproducing graphs
- Algorithms and Models for the Web-Graph
- Degree evolution in a general growing network
- The domination number of on-line social networks and random geometric graphs
- Correlated randomly growing graphs
- Random 4-regular graphs have 3-star decompositions asymptotically almost surely
- Some properties of random Apollonian networks
- Infinite Limits of Copying Models of the Web Graph
- Scale-free graphs of increasing degree
- Protean Graphs
- Activity ageing in growing networks
- On star decompositions of random regular graphs
This page was built for publication: Growing Protean Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3622686)