New implementation of known algorithms improve the running time of the best known algorithms for finding the vertex connectivity of undirected and directed graphs.
No takes yet. Share an insight, caveat, or question.
Zvi Galil (1980) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: