An Improved Algorithm for Parameterized Edge Dominating Set Problem

DOI10.1007/978-3-319-15612-5_21zbMATH Open1432.05071OpenAlexW118142941MaRDI QIDQ5176587

Ken Iwaide, Hiroshi Nagamochi

Publication date: 27 February 2015

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15612-5_21

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)

Improved complexity for power edge set problem ⋮ New Parameterized Algorithms for the Edge Dominating Set Problem

This page was built for publication: An Improved Algorithm for Parameterized Edge Dominating Set Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176587)