Pages that link to "Item:Q2335669"
From MaRDI portal
The following pages link to Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669):
Displaying 4 items.
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- On approximating (connected) 2-edge dominating set by a tree (Q1635808) (← links)
- Disjoint Sets in Graphs and its Application to Electrical Networks (Q3089062) (← links)
- Some results for the two disjoint connected dominating sets problem (Q5207499) (← links)