On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs

Keyphrases

• Bipartite Digraph 100%
• Connection Problem 100%
• Digraph 50%
• Edge Set 50%
• Edge-disjoint 50%
• K-connected 100%
• K-edge 50%
• K-edge-connected 50%
• Minimum Cost 50%
• Multi-cover 50%
• Polynomial-time Algorithm 50%
• Root Node 50%
• Set Function 50%
• Simple Proof 50%
• Supermodular 50%
• T-intersecting 50%

Engineering

• Polynomial Time 100%
• Root Node 100%