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

From MaRDI portal
Revision as of 00:23, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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