A refined exact algorithm for edge dominating set
From MaRDI portal
Publication:477194
DOI10.1016/j.tcs.2014.07.019zbMath1304.05142OpenAlexW2105489680MaRDI QIDQ477194
Mingyu Xiao, Hiroshi Nagamochi
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.07.019
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 (5)
Exact algorithms for maximum induced matching ⋮ New Results on Directed Edge Dominating Set ⋮ Unnamed Item ⋮ EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET ⋮ Exact algorithms for dominating induced matching based on graph partition
Cites Work
- Parameterized edge dominating set in graphs with degree bounded by 3
- New parameterized algorithms for the edge dominating set problem
- Efficiency in exponential time for domination-type problems
- On two techniques of combining branching and treewidth
- On generating all maximal independent sets
- Constrained weighted matchings and edge coverings in graphs
- Confining sets and avoiding bottleneck cases: a simple maximum independent set algorithm in degree-3 graphs
- Exact algorithms for edge domination
- Efficient exact algorithms through enumerating maximal independent sets and other techniques
- Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
- Enumerate and Measure: Improving Parameter Budget Management
- A measure & conquer approach for the analysis of exact algorithms
- edge dominating set: Efficient Enumeration-Based Exact Algorithms
- Edge Dominating Sets in Graphs
- On cliques in graphs
This page was built for publication: A refined exact algorithm for edge dominating set
