A bounded search tree algorithm for parameterized face cover

DOI10.1016/j.jda.2008.07.004zbMath1154.90600OpenAlexW2171126493MaRDI QIDQ1002098

Faisal N. Abu-Khzam, Michael A. Langston, Henning Fernau

Publication date: 23 February 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.07.004

zbMATH Keywords

fixed-parameter algorithmsplane graphsface coverplanar red-blue dominating set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Search theory (90B40)

Related Items (1)

Planarizing graphs and their drawings by vertex splitting

Cites Work

• Unnamed Item
• Refined memorization for vertex cover
• A top-down approach to search-trees: Improved algorithmics for 3-hitting set
• An efficient fixed-parameter algorithm for 3-hitting set
• Deeply asymmetric planar graphs
• A refined search tree technique for dominating set on planar graphs
• Two-Layer Planarization: Improving on Parameterized Algorithmics
• Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
• On the Complexity of Covering Vertices by Faces in a Planar Graph
• Exact algorithms for finding minimum transversals in rank-3 hypergraphs
• Mathematical Foundations of Computer Science 2004
• Parameterized and Exact Computation
• Automata, Languages and Programming

This page was built for publication: A bounded search tree algorithm for parameterized face cover