Non-Searchability of Random Scale-Free Graphs

被引：0
|
作者：
Duchon, Philippe [1 ]
Eggemann, Nicole
Hanusse, Nicolas [1 ]
机构：
[1] Univ Bordeaux 1, ENSEIRB, LaBRI, F-33405 Talence, France
来源：
PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING | 2007年
关键词：
Distributed algorithms; Random graphs; Routing;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：380 / 381
页数：2
相关论文
共 50 条
  • [1] Non-searchability of random power-law graphs
    Duchon, Philippe
    Eggemann, Nicole
    Hanusse, Nicolas
    [J]. PRINCIPLES OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2007, 4878 : 274 - +
  • [2] PageRank in Scale-Free Random Graphs
    Chen, Ningyuan
    Litvak, Nelly
    Olvera-Cravioto, Mariana
    [J]. ALGORITHMS AND MODELS FOR THE WEB GRAPH (WAW 2014), 2014, 8882 : 120 - 131
  • [3] Asymptotics for Cliques in Scale-Free Random Graphs
    Alastair Haig
    Fraser Daly
    Seva Shneer
    [J]. Journal of Statistical Physics, 2022, 189
  • [4] Statistical ensemble of scale-free random graphs
    Burda, Z
    Correia, JD
    Krzywicki, A
    [J]. PHYSICAL REVIEW E, 2001, 64 (04):
  • [5] Scale-free random graphs and Potts model
    D- S Lee
    K- I Goh
    B Kahng
    D Kim
    [J]. Pramana, 2005, 64 : 1149 - 1159
  • [6] Scale-free random graphs and Potts model
    Lee, DS
    Goh, KI
    Kahng, B
    Kim, D
    [J]. PRAMANA-JOURNAL OF PHYSICS, 2005, 64 (06): : 1149 - 1159
  • [7] Asymptotics for Cliques in Scale-Free Random Graphs
    Haig, Alastair
    Daly, Fraser
    Shneer, Seva
    [J]. JOURNAL OF STATISTICAL PHYSICS, 2022, 189 (02)
  • [8] Treewidth of Erdos-Renyi random graphs, random intersection graphs, and scale-free random graphs
    Gao, Yong
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (4-5) : 566 - 578
  • [9] The small giant component in scale-free random graphs
    Riordan, O
    [J]. COMBINATORICS PROBABILITY & COMPUTING, 2005, 14 (5-6): : 897 - 938
  • [10] The degree sequences and spectra of scale-free random graphs
    Jordan, Jonathan
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2006, 29 (02) : 226 - 242
12345