Small cuts and connectivity certificates: A fault tolerant approach

Keyphrases

• Minimum Cut 100%
• Edge-connectivity 60%
• Round Complexity 40%
• Sampling Methods 40%
• Poly-D 40%
• Graph Sampling 40%
• Tight 20%
• SIMPLE Algorithm 20%
• Universal Sets 20%
• Randomized Algorithms 20%
• Log-log 20%
• D 2O 20%
• Distributed Computing 20%
• Network Design 20%
• Deterministic Algorithm 20%
• Round numbers 20%
• Existing Algorithms 20%
• Fault-tolerant 20%
• Cardinality 20%
• Fault-tolerant Networks 20%
• Graph Diameter 20%
• Efficient Computation 20%
• Fault-tolerant Spanner 20%
• Congestion 20%
• Graph Construction 20%
• Graph Connectivity 20%
• Connection Problem 20%
• Sampling Approach 20%
• Sublinear Algorithms 20%
• Kuhn 20%
• Global Problems 20%
• CONGEST Model 20%
• Pritchard 20%
• D-diameter 20%
• Vertex-cut 20%
• Cycle Cover 20%

Computer Science

• Fault Tolerant 100%
• Sampling Technique 40%
• Approximation (Algorithm) 20%
• Subgraphs 20%
• Distributed Computing 20%
• Simple Algorithm 20%
• Randomized Algorithm 20%
• Cardinality 20%
• Efficient Computation 20%
• Network Design 20%
• Connectivity Graph 20%
• Sampling Approach 20%
• Connectivity Problem 20%
• Graph Construction 20%

Mathematics

• Edge 100%
• Edge-Connectivity 75%
• Sampling Technique 50%
• Open Problem 25%
• Integer 25%
• Universal Set 25%
• Cardinality 25%
• Connectivity Graph 25%