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

From MaRDI portal
Revision as of 18:01, 22 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers