Close to optimal decentralized routing in long-range contact networks (Q2581272): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fault-tolerant routing in peer-to-peer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of long-range percolation clusters on finite cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of a Cycle Plus a Random Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of a long-range percolation graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eclecticism shrinks even small worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The small-world phenomenon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Know thy neighbor's neighbor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing Kleinberg's (and other) small-world Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Height representation, critical exponents, and ergodicity in the four-state triangular Potts antiferromagnet / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Latest revision as of 14:48, 11 June 2024

scientific article
Language Label Description Also known as
English
Close to optimal decentralized routing in long-range contact networks
scientific article

    Statements

    Close to optimal decentralized routing in long-range contact networks (English)
    0 references
    0 references
    0 references
    9 January 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    small world
    0 references
    random graph model
    0 references
    routing algorithm
    0 references
    0 references