The following pages link to Minimum Edge Dominating Sets (Q3136610):
Displaying 50 items.
- A natural family of optimization problems with arbitrarily small approximation thresholds (Q293457) (← links)
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Approximation algorithms for partially covering with edges (Q930925) (← links)
- The stable marriage problem with master preference lists (Q1005239) (← links)
- Improved approximation bounds for edge dominating set in dense graphs (Q1006077) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- Approximability results for stable marriage problems with ties. (Q1426466) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- Hard variants of stable marriage. (Q1605313) (← links)
- Parameterized algorithms for stable matching with ties and incomplete lists (Q1708024) (← links)
- On the semitotal domination number of line graphs (Q1720344) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs (Q1944214) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- The complexity of total edge domination and some related results on trees (Q2023114) (← links)
- Complexity and characterization aspects of edge-related domination for graphs (Q2023127) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- A note on approximations of directed edge dominating set (Q2094379) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Domination versus edge domination (Q2197443) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Complexity of finding graph roots with girth conditions (Q2428666) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- On well-edge-dominated graphs (Q2673496) (← links)
- On the \(d\)-claw vertex deletion problem (Q2695329) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Maximal matching polytope in trees (Q2815540) (← links)
- Maximal matching and edge domination in complete multipartite graphs (Q2921894) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- The Complexity of Computing the Random Priority Allocation Matrix (Q3465944) (← links)
- Complementary nil vertex edge dominating sets (Q3466051) (← links)
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661) (← links)
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) (← links)
- Small maximal matchings of random cubic graphs (Q3652558) (← links)
- (Q4263477) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
