Pages that link to "Item:Q1300059"
From MaRDI portal
The following pages link to Directed vertex-connectivity augmentation (Q1300059):
Displaying 20 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)
- Hypergraph connectivity augmentation (Q1300056) (← links)
- A 1-\((S,T)\)-edge-connectivity augmentation algorithm (Q1300058) (← links)
- Increasing the rooted connectivity of a digraph by one (Q1300061) (← links)
- Increasing digraph arc-connectivity by arc addition, reversal and complement (Q1613410) (← links)
- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees (Q1821118) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- Augmenting weighted graphs to establish directed point-to-point connectivity (Q2359805) (← links)
- Connectivity augmentation of graphs (Q2816106) (← links)
- Primal-dual approach for directed vertex connectivity augmentation and generalizations (Q2921669) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- The minimum augmentation of a directed tree to ak-edge-connected directed graph (Q3798671) (← links)
- Primal-dual approach for directed vertex connectivity augmentation and generalizations (Q4962713) (← 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)
- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract) (Q6487973) (← links)
