A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone (Q4537611): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.10014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2114616060 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stability in circular arc graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Linear time algorithms on circular-arc graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph / rank | |||
Normal rank | |||
Latest revision as of 10:22, 4 June 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
