On the hardness of optimization in power-law graphs (Q2481967): 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 massive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Random Graph Model for Power Law Graphs / 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Latest revision as of 21:30, 27 June 2024

scientific article
Language Label Description Also known as
English
On the hardness of optimization in power-law graphs
scientific article

    Statements

    On the hardness of optimization in power-law graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2008
    0 references
    0 references
    power-law graphs
    0 references
    graph optimization problems
    0 references
    NP-hardness
    0 references
    graph construction algorithms
    0 references
    0 references