On Rooted k-Connectivity Problems in Quasi-bipartite Digraphs

Mathematics

• Digraph 100%
• Connectivity 97%
• Costs 78%
• Edge-disjoint Paths 24%
• Edge-connectivity 21%
• Polynomial-time Algorithm 16%
• Tail 16%
• Subgraph 14%
• Covering 14%
• Roots 13%
• Vertex of a graph 10%
• Subset 10%
• Integer 9%
• Arbitrary 9%

Engineering & Materials Science

• Costs 40%
• Set theory 22%
• Polynomials 13%