An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph (Q3790662): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071867466 / rank | |||
Normal rank | |||
Latest revision as of 22:19, 19 March 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
