Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Online algorithms for the maximum \(k\)-colorable subgraph problem |
scientific article; zbMATH DE number 6901559
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online algorithms for the maximum \(k\)-colorable subgraph problem |
scientific article; zbMATH DE number 6901559 |
Statements
Online algorithms for the maximum \(k\)-colorable subgraph problem (English)
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
