Algorithms for the minimum edge cover of \(H\)-subgraphs of a graph (Q3401110)
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 5664074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the minimum edge cover of \(H\)-subgraphs of a graph |
scientific article; zbMATH DE number 5664074 |
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
0.8621363639831543
0 references
0.7713851928710938
0 references
0.7660689353942871
0 references
0.7619807720184326
0 references
0.7575090527534485
0 references
