An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133): Difference between revisions
From MaRDI portal
Latest revision as of 16:08, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs |
scientific article |
Statements
An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (English)
0 references
1981
0 references