Parameterized Edge Dominating Set in Cubic Graphs
DOI10.1007/978-3-642-21204-8_14zbMath1329.05288OpenAlexW174059557MaRDI QIDQ3004660
Mingyu Xiao, Hiroshi Nagamochi
Publication date: 3 June 2011
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_14
Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Cites Work
- Unnamed Item
- On two techniques of combining branching and treewidth
- On generating all maximal independent sets
- Efficient exact algorithms through enumerating maximal independent sets and other techniques
- Parameterized Edge Dominating Set in Cubic Graphs
- 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
- edge dominating set: Efficient Enumeration-Based Exact Algorithms
- Exact Algorithms for Edge Domination
- Maximum Independent Set in Graphs of Average Degree at Most Three in ${\mathcal O}(1.08537^n)$
- A Note on Vertex Cover in Graphs with Maximum Degree 3
- An Improved Exact Algorithm for Cubic Graph TSP
- Edge Dominating Sets in Graphs
- An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
This page was built for publication: Parameterized Edge Dominating Set in Cubic Graphs
