New Parameterized Algorithms for the Edge Dominating Set Problem

DOI10.1007/978-3-642-22993-0_54zbMath1343.68125OpenAlexW1712147032WikidataQ62041807 ScholiaQ62041807MaRDI QIDQ3088075

Mingyu Xiao, Ton Kloks, Sheung-Hung Poon

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_54

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Planar graph vertex partition for linear problem kernels ⋮ On the parameterized complexity of vertex cover and edge cover with connectivity constraints

This page was built for publication: New Parameterized Algorithms for the Edge Dominating Set Problem