A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611)

From MaRDI portal
Revision as of 10:22, 4 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1762002
Language Label Description Also known as
English
A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone
scientific article; zbMATH DE number 1762002

    Statements

    A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2002
    0 references
    circular-arc graph
    0 references
    independent set
    0 references

    Identifiers

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