Greedy routing in small-world networks with power-law degrees (Q2256946): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974041154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Object location using path separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
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 a scale-free random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average Distance in a Random Graph with Given Expected Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for blind search on the integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for greedy routing in uniform small world rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Could any graph be turned into a small-world? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eclecticism shrinks even small worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of power-law degrees on the navigability of small worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the searchability of small-world networks with arbitrary underlying structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of greedy routing in ring-based peer-to-peer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal path search in small worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The small-world phenomenon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / 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: Q2921684 / 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: Distance estimation and object location via rings of neighbors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Revision as of 17:10, 9 July 2024

scientific article
Language Label Description Also known as
English
Greedy routing in small-world networks with power-law degrees
scientific article

    Statements

    Greedy routing in small-world networks with power-law degrees (English)
    0 references
    0 references
    0 references
    23 February 2015
    0 references
    small worlds
    0 references
    social networks
    0 references
    routing
    0 references
    search
    0 references
    power-law degrees
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references