Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph

DOI10.1007/978-3-642-11266-9_38zbMath1274.05449MaRDI QIDQ3401110

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

planar graph; bounded treewidth; \(H\)-free graph; minimum edge deletion; Baker's approximation scheme

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms