Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the minimum clique cover and other hard problems in subtree filament graphs |
scientific article |
Statements
Approximating the minimum clique cover and other hard problems in subtree filament graphs (English)
0 references
28 September 2006
0 references
subtree filament graph
0 references
circle graph
0 references
clique cover
0 references
NP-complete
0 references
approximation algorithm
0 references
