Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429)

From MaRDI portal
Revision as of 05:46, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
scientific article

    Statements

    Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2011
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references