Protean graphs with a variety of ranking schemes (Q1040591): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5457639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Based Attachment Leads to Power Law Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protean Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sudden emergence of a giant \(k\)-core in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of protean graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity threshold and recovery time in rank-based models for complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protean Graphs with a Variety of Ranking Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Growing Protean Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938890 / rank
 
Normal rank

Latest revision as of 05:56, 2 July 2024

scientific article
Language Label Description Also known as
English
Protean graphs with a variety of ranking schemes
scientific article

    Statements

    Protean graphs with a variety of ranking schemes (English)
    0 references
    0 references
    25 November 2009
    0 references
    random graphs
    0 references
    web graphs
    0 references
    protean graphs
    0 references
    degree distribution
    0 references
    differential equations method
    0 references
    power law graphs
    0 references
    scale-free networks
    0 references

    Identifiers