Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218)

From MaRDI portal
Revision as of 07:47, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Advice complexity of maximum independent set in sparse and bipartite graphs
scientific article

    Statements

    title
    Advice complexity of maximum independent set in sparse and bipartite graphs (English)
    0 references
    author
    Stefan Dobrev
    0 references
    Rastislav Královič
    0 references
    Richard Královič
    0 references
    publication date
    12 May 2015
    0 references
    Mathematics Subject Classification ID
    68W27
    0 references
    05C69
    0 references
    05C85
    0 references
    zbMATH DE Number
    6435525
    0 references
    zbMATH Keywords
    online algorithms
    0 references
    advice complexity
    0 references
    maximum independent set
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2344218&oldid=26889191"
    Powered by MediaWiki