ISSN 1944-9488
Vol. 5, Issue 1, 2008December 31, 2007 EDT
Deterministic Decentralized Search in Random Graphs
Deterministic Decentralized Search in Random Graphs
Esteban Arcaute, David Liben-Nowell, Ning Chen, Ravi Kumar, Hamid Nazerzadeh, Ying Xu, Mohammad Mahdian,
Articles in Vol. 5, Issue 1, 2008
Vol. 5, Issue 1, 2008
- Local Partitioning for Directed Graphs Using PageRankKevin LangFan ChungReid Andersen
- Deterministic Decentralized Search in Random GraphsEsteban ArcauteDavid Liben-NowellNing ChenRavi KumarHamid NazerzadehYing XuMohammad Mahdian
- Finding Strongly Knit Clusters in Social NetworksRobert SchreiberRobert E. TarjanNina MishraIsabelle Stanton
- A Singular Perturbation Approach for Choosing the PageRank Damping FactorKim Son PhamKonstantin AvrachenkovNelly Litvak
- Directed Random Dot Product GraphsEdward ScheinermanStephen J. Young
- Local Computation of PageRank ContributionsJohn HopcroftChristian BorgsShang-Hua TengReid AndersenVahab MirrokniJennifer Chayes
- Manipulation-Resistant Reputations Using Hitting TimeJohn HopcroftDaniel Sheldon
- The Structure of Geographical Threshold GraphsAric HagbergAllon G. PercusMilan Bradonjić
- A Spatial Web Graph Model with Local Influence RegionsC. CooperJ. JanssenA. BonatoP. PrałatW. Aiello
Arcaute, Esteban, David Liben-Nowell, Ning Chen, Ravi Kumar, Hamid Nazerzadeh, Ying Xu, and Mohammad Mahdian. 2008. “Deterministic Decentralized Search in Random Graphs.” Internet Mathematics 5 (1). https://doi.org/10.1080/15427951.2008.10129298.