
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
41st Annual Symposium on Foundations of Computer Science
Using expander graphs to find vertex connectivity
Redondo Beach, California
November 12November 14
ISBN: 0769508502
ASCII Text  x  
H.N. Gabow, "Using expander graphs to find vertex connectivity," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 410, 41st Annual Symposium on Foundations of Computer Science, 2000.  
BibTex  x  
@article{ 10.1109/SFCS.2000.892129, author = {H.N. Gabow}, title = {Using expander graphs to find vertex connectivity}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {2000}, issn = {02725428}, pages = {410}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2000.892129}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Using expander graphs to find vertex connectivity SN  02725428 SP EP A1  H.N. Gabow, PY  2000 KW  graph theory; computational complexity; expander graphs; vertex connectivity; digraph; time bound; undirected graph; nesting properties; separation triples; complexity VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
The (vertex) connectivity /spl kappa/ of a graph is the smallest number of vertices whose deletion separates the graph or makes it trivial. We present the fastest known algorithm for finding /spl kappa/. For a digraph with n vertices, m edges and connectivity /spl kappa/ the time bound is O((n+min(/spl kappa//sup 5/2/,/spl kappa/n/sup 3/4/))m). This improves the previous best bound of O((n+min(/spl kappa//sup 3/,/spl kappa/n))m). For an undirected graph both of these bounds hold with m replaced /spl kappa/n. Our approach uses expander graphs to exploit nesting properties of certain separation triples.
Index Terms:
graph theory; computational complexity; expander graphs; vertex connectivity; digraph; time bound; undirected graph; nesting properties; separation triples; complexity
Citation:
H.N. Gabow, "Using expander graphs to find vertex connectivity," focs, pp.410, 41st Annual Symposium on Foundations of Computer Science, 2000
Usage of this product signifies your acceptance of the Terms of Use.