Modelling and solving the perfect edge domination problem
From MaRDI portal
Publication:2174880
DOI10.1007/s11590-018-1335-xzbMath1442.90193OpenAlexW2896791044MaRDI QIDQ2174880
Min Chih Lin, Abilio Lucena, Vinicius L. do Forte, Nelson F. Maculan, Veronica A. Moyano, Jayme Luiz Szwarcfiter
Publication date: 27 April 2020
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11336/92974
Related Items
Extended formulations for perfect domination problems and their algorithmic implications, Uncertain Measure and its Application in Minimum Weighted Maximal Matching Problem
Uses Software
Cites Work
- Unnamed Item
- Efficient and perfect domination on circular-arc graphs
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Exact algorithms for minimum weighted dominating induced matching
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Distance regular subgraphs of a cube
- On the complexity of the dominating induced matching problem in hereditary classes of graphs
- Efficient edge domination in regular graphs
- Minimum-maximal matching in series-parallel graphs
- Symmetric Y-graphs and H-graphs
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- Efficient edge domination problems in graphs
- Perfect edge domination and efficient edge domination in graphs
- Perfect edge domination: hard and solvable cases
- On the dominating induced matching problem: spectral results and sharp bounds
- Integer programming formulations for the minimum weighted maximal matching problem
- The weighted perfect domination problem and its variants
- Fast algorithms for some dominating induced matching problems
- Exact algorithms for dominating induced matching based on graph partition
- Perfect codes in graphs
- Decomposition algorithms for solving the minimum weight maximal matching problem
- A Polynomial-time Algorithm for the Dominating Induced Matching Problem in the Class of Convex Graphs
- Minimum Edge Dominating Sets
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
- Edge Dominating Sets in Graphs
- Dominating sets in n‐cubes
- Dominating induced matchings in graphs containing no long claw
- The edge domination problem
- Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
