Pages that link to "Item:Q1006077"
From MaRDI portal
The following pages link to Improved approximation bounds for edge dominating set in dense graphs (Q1006077):
Displaying 14 items.
- New parameterized algorithms for the edge dominating set problem (Q392035) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Improved approximation for spanning star forest in dense graphs (Q1944390) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← 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)
- On the \(k\)-edge-incident subgraph problem and its variants (Q2446891) (← links)
- Maximal matching polytope in trees (Q2815540) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← 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)
