On certain connectivity properties of the internet topology (Q2490261): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Random Graph Model for Power Law Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The degree sequence of a scale-free random graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and Construction of Edge-Disjoint Paths on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the cover time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems of Paul Erd�s in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distances in random graphs with given expected degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spectra of Random Graphs with Given Expected Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crawling on web graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing the uniformity and independence assumptions using the concept of fractal dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A BGP-based mechanism for lowest-cost routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4902563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank

Latest revision as of 13:38, 24 June 2024

scientific article
Language Label Description Also known as
English
On certain connectivity properties of the internet topology
scientific article

    Statements

    On certain connectivity properties of the internet topology (English)
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    0 references
    Conductance
    0 references
    Scale-free networks
    0 references
    Internet
    0 references
    Frugality
    0 references
    Random graphs
    0 references
    0 references