Constant-time connectivity tests
Philipp Klaus Krause
TL;DR
This paper introduces constant-time algorithms for various connectivity problems, improving runtime for some and providing new solutions for others, with applications in graph analysis.
Contribution
It presents new and improved constant-time algorithms for connectivity and related problems, enhancing efficiency and expanding the toolkit for graph property testing.
Findings
Some algorithms are improved variants of known methods.
New algorithms achieve better runtime for connectivity problems.
Results include estimates of distance and tolerant testers for connectivity and edge-connectivity.
Abstract
We present implementations of constant-time algorithms for connectivity tests and related problems. Some are implementations of slightly improved variants of previously known algorithms; for other problems we present new algorithms that have substantially better runtime than previously known algorithms (estimates of the distance to and tolerant testers for connectivity, 2-edge-connectivity, 3-edge-connectivity, eulerianity).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Optimization and Search Problems · Distributed systems and fault tolerance