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

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 16:17, 5 March 2024

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