Pages that link to "Item:Q764308"
From MaRDI portal
The following pages link to Approximating edge dominating set in dense graphs (Q764308):
Displaying 16 items.
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Algorithmic aspects of upper edge domination (Q2034795) (← links)
- Tight inapproximability of minimum maximal matching on bipartite graphs and related problems (Q2085735) (← 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)
- Domination versus edge domination (Q2197443) (← links)
- Bounding and approximating minimum maximal matchings in regular graphs (Q2222947) (← links)
- New results on polynomial inapproximability and fixed parameter approximability of Edge Dominating Set (Q2345984) (← 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)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- New Results on Directed Edge Dominating Set (Q5005171) (← links)
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET (Q5025346) (← links)
- (Q5090486) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
