Pages that link to "Item:Q1635808"
From MaRDI portal
The following pages link to On approximating (connected) 2-edge dominating set by a tree (Q1635808):
Displaying 4 items.
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- A polylogarithmic approximation algorithm for 2-edge-connected dominating set (Q2234806) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- EDGE DOMINATION NUMBER AND THE NUMBER OF MINIMUM EDGE DOMINATING SETS IN PSEUDOFRACTAL SCALE-FREE WEB AND SIERPIŃSKI GASKET (Q5025346) (← links)