On Finding the Vertex Connectivity of Graphs.
Milind Girkar, Milind Sohoni · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · 1987
TERMS (Continue on reverse if necessary a n d identify by block num ber) Vertex connectivity,'Graph algorithm, Network flows ABSTRACT (Continue on reverse if necessary a n d identify by block num ber)An implementation of the fastest known algorithm to find the vertex connectivity of graphs with reduced space requirement is presented.