Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural sparsity of complex networks: bounded expansion in random models and real-world graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of the vertex cover problem in power-law graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of dominating set on power law graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New techniques for approximating optimal substructure problems in power-law graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of labeled graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems in the enumeration of labelled graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A critical point for random graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Size of the Giant Component of a Random Graph with a Given Degree Sequence / 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 degree sequence of a scale-free random graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components in random graphs with given expected degree sequences / 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: Generating simple random graphs with prescribed degree distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The phase transition in inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs and Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank

Latest revision as of 12:49, 12 July 2024

scientific article
Language Label Description Also known as
English
Minimum vertex cover in generalized random graphs with power law degree distribution
scientific article

    Statements

    Minimum vertex cover in generalized random graphs with power law degree distribution (English)
    0 references
    0 references
    0 references
    1 September 2016
    0 references
    Chung-Lu random graph model
    0 references
    Britton random graph model
    0 references
    generalized random graph model
    0 references
    approximation algorithms
    0 references
    vertex cover problem
    0 references
    power-law graphs
    0 references

    Identifiers

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