Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431)

From MaRDI portal
Revision as of 15:57, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
scientific article

    Statements

    Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    rank-width
    0 references
    linear rank-width
    0 references
    distance-hereditary graphs
    0 references
    vertex-minors
    0 references
    matroid branch-width
    0 references
    matroid path-width
    0 references
    0 references
    0 references
    0 references