Constant-time connectivity tests
Data Structures and Algorithms
2022-09-26 v2 Computational Complexity
Discrete Mathematics
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).
Cite
@article{arxiv.2010.04527,
title = {Constant-time connectivity tests},
author = {Philipp Klaus Krause},
journal= {arXiv preprint arXiv:2010.04527},
year = {2022}
}