An NC algorithm for the clique cover problem in cocomparability graphs and its application (Q1351615)

From MaRDI portal
Revision as of 10:11, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An NC algorithm for the clique cover problem in cocomparability graphs and its application
scientific article

    Statements

    An NC algorithm for the clique cover problem in cocomparability graphs and its application (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    Cocomparability graphs
    0 references
    Permutation graphs
    0 references
    Minimum clique cover
    0 references
    Depth-first search
    0 references

    Identifiers