A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:04, 7 February 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
1 July 2002
0 references
circular-arc graph
0 references
independent set
0 references
