An Improved Algorithm for Parameterized Edge Dominating Set Problem
From MaRDI portal
Publication:2790152
DOI10.7155/jgaa.00383zbMath1331.05171OpenAlexW2294527711MaRDI QIDQ2790152
Publication date: 3 March 2016
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00383
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
New Results on Directed Edge Dominating Set ⋮ In)approximability of Maximum Minimal FVS ⋮ Unnamed Item ⋮ (In)approximability of maximum minimal FVS
This page was built for publication: An Improved Algorithm for Parameterized Edge Dominating Set Problem
