An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (Q3790662): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:34, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph |
scientific article |
Statements
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (English)
0 references
1988
0 references
optimal algorithm
0 references
maximum independent set
0 references
circular-arc graph
0 references
