Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.03.003 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2076513440 / rank | |||
Normal rank |
Revision as of 02:53, 20 March 2024
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