Algorithms for finding clique-transversals of graphs (Q940841)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5320587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding clique-transversals of graphs |
scientific article; zbMATH DE number 5320587 |
Statements
Algorithms for finding clique-transversals of graphs (English)
0 references
3 September 2008
0 references
algorithms
0 references
circular-arc graphs
0 references
clique-transversals
0 references
Helly circular-arc graphs
0 references
\(\overline{3K_{2}}\)-free circular-arc graphs
0 references
0.8726180791854858
0 references
0.8726180791854858
0 references
0.8319898843765259
0 references
0.818549633026123
0 references
