Faster Algorithms for Edge Connectivity via Random 2-Out Contractions

doi 10.1137/1.9781611975994.77
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

The Random Connection Model: Connectivity, Edge Lengths, and Degree Distributions

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2017English

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs

2017English

Faster Update Time for Turnstile Streaming Algorithms

2020English

Faster Algorithms for 1-Mappability of a Sequence

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2020English

Two ID-Free Distributed Distance-2 Edge Coloring Algorithms for WSNs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Faster Algebraic Algorithms for Path and Packing Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2008English

Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

English

Random Fixed Points for Ψ-Contractions With Application to Random Differential Equations

Filomat
Mathematics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy