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

From MaRDI portal
Revision as of 15:24, 13 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q340580)
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

    title
    Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (English)
    0 references
    author
    Alexander Langer
    0 references
    Somnath Sikdar
    0 references
    publication date
    1 July 2011
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C85
    0 references
    68R10
    0 references
    91A43
    0 references
    zbMATH DE Number
    5916989
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3010429&oldid=21016946"
    Powered by MediaWiki