A Refined Exact Algorithm for Edge Dominating Set

DOI10.1007/978-3-642-29952-0_36zbMath1354.05136OpenAlexW2176317809MaRDI QIDQ2898046

Hiroshi Nagamochi, Mingyu Xiao

Publication date: 16 July 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (4)

New parameterized algorithms for the edge dominating set problem ⋮ New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set ⋮ An Improved Exact Algorithm for Undirected Feedback Vertex Set ⋮ An improved exact algorithm for undirected feedback vertex set

This page was built for publication: A Refined Exact Algorithm for Edge Dominating Set