Could any graph be turned into a small-world? (Q2368969): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2056455770 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4436057 / 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: Q4011119 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The small-world phenomenon / 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: Renormalization group analysis of the small-world network model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2921684 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Collective dynamics of ‘small-world’ networks / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 13:11, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Could any graph be turned into a small-world? |
scientific article |
Statements
Could any graph be turned into a small-world? (English)
0 references
28 April 2006
0 references
Small-world
0 references
Random graph model
0 references
Routing algorithm
0 references