Parameterized edge dominating set in graphs with degree bounded by 3
DOI10.1016/J.TCS.2012.08.015zbMATH Open1325.05132OpenAlexW2000108275MaRDI QIDQ388085FDOQ388085
Authors: Mingyu Xiao, Hiroshi Nagamochi 
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.08.015
Recommendations
- Parameterized edge dominating set in cubic graphs (extended abstract)
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
- An improved algorithm for parameterized edge dominating set problem
- New parameterized algorithms for the edge dominating set problem
- New Parameterized Algorithms for the Edge Dominating Set Problem
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- An Improved Exact Algorithm for Cubic Graph TSP
- On two techniques of combining branching and treewidth
- Edge Dominating Sets in Graphs
- On generating all maximal independent sets
- edge dominating set: Efficient Enumeration-Based Exact Algorithms
- Efficient exact algorithms through enumerating maximal independent sets and other techniques
- A note on vertex cover in graphs with maximum degree 3
- Parameterized edge dominating set in cubic graphs (extended abstract)
- Enumerate and measure: improving parameter budget management
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
- A simple and fast algorithm for Maximum Independent Set in 3-degree graphs (extended abstract)
- Exact Algorithms for Edge Domination
- Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\)
- New results on polynomial inapproximability and fixed parameter approximability of \textsc{Edge Dominating Set}
Cited In (13)
- SOFSEM 2006: Theory and Practice of Computer Science
- Parameterized edge dominating set in cubic graphs (extended abstract)
- Upper and lower bounds on approximating weighted mixed domination
- Maximum matching and kernelization of edge dominating set
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set
- Parameterized complexity of three edge contraction problems with degree constraints
- Exact and Parameterized Algorithms for Edge Dominating Set in 3-Degree Graphs
- A refined exact algorithm for edge dominating set
- An improved algorithm for parameterized edge dominating set problem
- An improved algorithm for parameterized edge dominating set problem
- A multivariate approach for weighted FPT algorithms
- Title not available (Why is that?)
- A multivariate framework for weighted FPT algorithms
This page was built for publication: Parameterized edge dominating set in graphs with degree bounded by 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388085)
