Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561)

From MaRDI portal
Revision as of 18:11, 24 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
Online algorithms for the maximum \(k\)-colorable subgraph problem
scientific article

    Statements

    Online algorithms for the maximum \(k\)-colorable subgraph problem (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    online algorithms
    0 references
    maximum \(k\)-colorable subgraph
    0 references
    sequential vertex coloring
    0 references
    competitive analysis
    0 references

    Identifiers