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

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

Natalya Usotskaya, Alexander Grigoriev, Bert Marchal

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 graphbounded treewidth\(H\)-free graphminimum edge deletionBaker's approximation scheme

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)

This page was built for publication: Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph