Rank-width of random graphs (Q2897211): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1001.0461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Threshold of Having a Linear Treewidth in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank‐width is less than or equal to branch‐width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank

Latest revision as of 11:21, 5 July 2024

scientific article
Language Label Description Also known as
English
Rank-width of random graphs
scientific article

    Statements

    Rank-width of random graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    rank-width
    0 references
    tree-width
    0 references
    clique-width
    0 references
    random graph
    0 references
    sharp threshold
    0 references
    0 references
    0 references