On rooted node-connectivity problems

Keyphrases

• Connection Problem 100%
• Node Connectivity 100%
• Approximation Guarantee 100%
• Disjoint Paths 100%
• Approximation Algorithms 50%
• Minimum Weight 50%
• Uniform Weights 50%
• Splitting off 50%
• Edge Nodes 50%
• Edge Weight 50%
• Am(III) 50%
• Root Node 50%
• Number of Positive Nodes 50%

Computer Science

• Approximation (Algorithm) 100%
• Connectivity Problem 100%
• Approximation Algorithms 50%
• Connectivity Node 50%
• Subgraphs 50%
• Sufficient Condition 50%

Mathematics

• Edge 100%
• Uniform Weight 16%
• Root Node 16%
• Necessary and Sufficient Condition 16%