Algorithms for the minimum edge cover of H-subgraphs of a graph

DOI10.1007/978-3-642-11266-9_38MaRDI QIDQ3401110zbMATH OpenOpenAlexFDO

Authors Alexander Grigoriev, Bert Marchal, Natalya Usotskaya

Publication date 28 January 2010

Published in SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11266-9_38

zbMATH Keywords

\(H\)-free graphBaker's approximation schemebounded treewidthminimum edge deletionplanar graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• A Note on the Minimum H-Subgraph Edge Deletion
• Subexponential algorithms for partial cover problems
• Subexponential algorithms for partial cover problems
• An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs
• Covering a hypergraph of subgraphs

Cited in

(1)

• A Note on the Minimum H-Subgraph Edge Deletion

This page was built for publication: Algorithms for the minimum edge cover of \(H\)-subgraphs of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401110)