Recommendations
Cited in
(62)- The stable marriage problem with master preference lists
- Improved approximation bounds for edge dominating set in dense graphs
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Using maximality and minimality conditions to construct inequality chains
- Approximability results for stable marriage problems with ties.
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- Hard variants of stable marriage.
- Parameterized algorithms for stable matching with ties and incomplete lists
- On the semitotal domination number of line graphs
- Integer programming formulations for the minimum weighted maximal matching problem
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem
- Algorithmic aspects of clique-transversal and clique-independent sets
- The complexity of total edge domination and some related results on trees
- Complexity and characterization aspects of edge-related domination for graphs
- Aspects of upper defensive alliances
- Algorithmic aspects of upper edge domination
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem
- A note on approximations of directed edge dominating set
- Minimum maximal matchings in cubic graphs
- Modelling and solving the perfect edge domination problem
- Domination versus edge domination
- Improved budgeted connected domination and budgeted edge-vertex domination
- Bounding and approximating minimum maximal matchings in regular graphs
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames
- Approximation hardness of edge dominating set problems
- Complexity of finding graph roots with girth conditions
- Approximability of the capacitated \(b\)-edge dominating set problem
- Generalizing the induced matching by edge capacity constraints
- Linear time algorithms for generalized edge dominating set problems
- On well-edge-dominated graphs
- On the d-claw vertex deletion problem
- Fast and simple local algorithms for 2-edge dominating sets and 3-total vertex covers
- Decomposition algorithms for solving the minimum weight maximal matching problem
- Maximal matching polytope in trees
- Maximal matching and edge domination in complete multipartite graphs
- A natural family of optimization problems with arbitrarily small approximation thresholds
- Hardness and approximation of minimum maximal matchings
- On the complexity of variations of mixed domination on graphs
- On the algorithmic complexity of edge total domination
- The complexity of computing the random priority allocation matrix
- Complementary nil vertex edge dominating sets
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem
- Small maximal matchings of random cubic graphs
- scientific article; zbMATH DE number 1341915 (Why is no real title available?)
- Results on accurate edge domination number in graphs
- Approximating dominating set on intersection graphs of rectangles and L-frames
- New results on directed edge dominating set
- Edge domination number and the number of minimum edge dominating sets in pseudofractal scale-free web and Sierpiński gasket
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
- Approximation Algorithms for Facial Cycles in Planar Embeddings
- Smallest maximal matchings of graphs
- Hardness and approximation results for some variants of stable marriage problem
- Incidence‐free sets and edge domination in incidence graphs
- On the \(d\)-claw vertex deletion problem
- Algorithms and hardness results for edge total domination problem in graphs
- Edge domination on bipartite permutation graphs and cotriangulated graphs
- Parameterized complexity of locally minimal defensive alliances
- Minimum maximal matchings in phenylene chains
- Approximating edge dominating set in dense graphs
- Approximation algorithms for partially covering with edges
This page was built for publication: Minimum Edge Dominating Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136610)
