当前位置:
X-MOL 学术
›
arXiv.cs.CC
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Constant-time connectivity tests
arXiv - CS - Computational Complexity Pub Date : 2020-10-09 , DOI: arxiv-2010.04527 Philipp Klaus Krause
arXiv - CS - Computational Complexity Pub Date : 2020-10-09 , DOI: arxiv-2010.04527 Philipp Klaus Krause
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).
中文翻译:
恒定时间连通性测试
我们提出了用于连通性测试和相关问题的恒定时间算法的实现。有些是先前已知算法的略微改进变体的实现;对于其他问题,我们提出了新算法,这些算法的运行时间比以前已知的算法要好得多(估计与连通性、2 边连通性、3 边连通性、欧拉性测试者的距离和容忍度)。
更新日期:2020-10-12
中文翻译:
恒定时间连通性测试
我们提出了用于连通性测试和相关问题的恒定时间算法的实现。有些是先前已知算法的略微改进变体的实现;对于其他问题,我们提出了新算法,这些算法的运行时间比以前已知的算法要好得多(估计与连通性、2 边连通性、3 边连通性、欧拉性测试者的距离和容忍度)。