Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
From MaRDI portal
Publication:3066473
DOI10.1007/978-3-642-17461-2_31zbMath1311.05198OpenAlexW1580479523MaRDI QIDQ3066473
Publication date: 10 January 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17461-2_31
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 (4)
A multivariate framework for weighted FPT algorithms ⋮ Parameterized edge dominating set in graphs with degree bounded by 3 ⋮ Parameterized Edge Dominating Set in Cubic Graphs ⋮ Unnamed Item
This page was built for publication: Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs