Polynomial time algorithms on circular-arc overlap graphs (Q3211136)
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: Polynomial time algorithms on circular-arc overlap graphs |
scientific article; zbMATH DE number 4191426
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time algorithms on circular-arc overlap graphs |
scientific article; zbMATH DE number 4191426 |
Statements
Polynomial time algorithms on circular-arc overlap graphs (English)
0 references
1991
0 references
independent set
0 references
circular-arc overlap graphs
0 references
polynomial-time algorithms
0 references
maximum clique
0 references
0.8807123303413391
0 references
0.8498991131782532
0 references
0.8492191433906555
0 references
0.84673672914505
0 references
