Algorithms for clique-independent sets on subclasses of circular-arc graphs (Q2500526)
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: Algorithms for clique-independent sets on subclasses of circular-arc graphs |
scientific article; zbMATH DE number 5047509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for clique-independent sets on subclasses of circular-arc graphs |
scientific article; zbMATH DE number 5047509 |
Statements
Algorithms for clique-independent sets on subclasses of circular-arc graphs (English)
0 references
17 August 2006
0 references
Helly circular-arc graphs
0 references
0 references
0.8276420831680298
0 references
0.8233853578567505
0 references
0.8223397135734558
0 references
0.8200988173484802
0 references
