Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity

DOI10.1145/3564822MaRDI QIDQ6127832zbMATH OpenOpenAlexFDO

Authors Sorrachai Yingchareonthawornchai

Publication date 14 April 2024

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3564822

zbMATH Keywords

algorithm engineeringalgorithmic graph theorysublinear algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Engineering nearly linear-time algorithms for small vertex connectivity
• Breaking quadratic time for small vertex connectivity and an approximation scheme
• Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
• Using expander graphs to find vertex connectivity
• A probabilistic algorithm for vertex connectivity of graphs

Cited in

(1)

• Engineering nearly linear-time algorithms for small vertex connectivity

This page was built for publication: Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6127832)