Online algorithms for the maximum \(k\)-colorable subgraph problem (Q1652561): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2017.10.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2761361573 / rank | |||
Normal rank | |||
Revision as of 22:40, 19 March 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
