A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone |
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
1 July 2002
0 references
circular-arc graph
0 references
independent set
0 references
