Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815)

From MaRDI portal
Revision as of 10:27, 6 June 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
Maximum independent set and maximum clique algorithms for overlap graphs
scientific article

    Statements

    Maximum independent set and maximum clique algorithms for overlap graphs (English)
    0 references
    25 September 2003
    0 references
    overlap graphs
    0 references
    independent set
    0 references
    clique
    0 references
    algorithm
    0 references
    subtrees in a tree
    0 references
    subtree overlap graphs
    0 references
    0 references
    0 references

    Identifiers