Polynomial time algorithms on circular-arc overlap graphs (Q3211136)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Polynomial time algorithms on circular-arc overlap graphs
scientific article

    Statements

    Polynomial time algorithms on circular-arc overlap graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1991
    0 references
    independent set
    0 references
    circular-arc overlap graphs
    0 references
    polynomial-time algorithms
    0 references
    maximum clique
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references