Pages that link to "Item:Q1821118"
From MaRDI portal
The following pages link to An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees (Q1821118):
Displaying 3 items.
- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees (Q1821118) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)