Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2017.10.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2017.10.003 / rank | |||
Normal rank | |||
Latest revision as of 01:09, 11 December 2024
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
11 July 2018
0 references
online algorithms
0 references
maximum \(k\)-colorable subgraph
0 references
sequential vertex coloring
0 references
competitive analysis
0 references
