Pages that link to "Item:Q1300059"
From MaRDI portal
The following pages link to Directed vertex-connectivity augmentation (Q1300059):
Displaying 8 items.
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Strongly connectable digraphs and non-transitive dice (Q5154618) (← links)
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs (Q6058195) (← links)
- Making a tournament k $k$‐strong (Q6094049) (← links)
