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

From MaRDI portal
Revision as of 02:20, 21 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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