Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245): Difference between revisions
From MaRDI portal
Latest revision as of 10:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs |
scientific article |
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