Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245)
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: Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs |
scientific article; zbMATH DE number 897359
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs |
scientific article; zbMATH DE number 897359 |
Statements
Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (English)
0 references
5 August 1996
0 references
circular arc graphs
0 references
interval graphs
0 references
NP-hard optimization problems
0 references
0 references
