Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph (Q3401110)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph |
scientific article |
Statements
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph (English)
0 references
28 January 2010
0 references
minimum edge deletion
0 references
\(H\)-free graph
0 references
bounded treewidth
0 references
Baker's approximation scheme
0 references
planar graph
0 references
