An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133)

From MaRDI portal
Revision as of 23:57, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    1981
    0 references

    Identifiers