Computing rank-width exactly (Q989474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / 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. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast multiplication of large numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491020 / rank
 
Normal rank

Latest revision as of 03:20, 3 July 2024

scientific article
Language Label Description Also known as
English
Computing rank-width exactly
scientific article

    Statements

    Computing rank-width exactly (English)
    0 references
    20 August 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    rank-width
    0 references
    branch-width
    0 references
    exact exponential algorithms
    0 references
    fast subset convolution
    0 references
    0 references
    0 references