A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (Q1933649)

From MaRDI portal
Revision as of 12:39, 29 July 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
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width
scientific article

    Statements

    A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (English)
    0 references
    0 references
    0 references
    0 references
    24 January 2013
    0 references
    0 references
    XP algorithms
    0 references
    MSOL-partitioning problems
    0 references