Abstract
We give various characterizations ofk-vertex connected graphs by geometric, algebraic, and “physical” properties. As an example, a graphG isk-connected if and only if, specifying anyk vertices ofG, the vertices ofG can be represented by points of ℝk−1 so that nok are on a hyper-plane and each vertex is in the convex hull of its neighbors, except for thek specified vertices. The proof of this theorem appeals to physics. The embedding is found by letting the edges of the graph behave like ideal springs and letting its vertices settle in equilibrium.
As an algorithmic application of our results we give probabilistic (Monte-Carlo and Las Vegas) algorithms for computing the connectivity of a graph. Our algorithms are faster than the best known (deterministic) connectivity algorithms for allk≧√n, and for very dense graphs the Monte Carlo algorithm is faster by a linear factor.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V.Aho J. E.Hopcropt and J. D.Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, 1975.
S. Berkowitz, On computing the determinant in small parallel time using a small number of processors,Inform. Proc. Let.,18 (1984), 147–150.
G.Birkhoff and S.MacLane,A Survey of Modern Algebra, MacMillan, 1970.
D.Coppersmith and S.Winograd, On the asymptotic complexity of matrix multiplication,SIAM J. Computing, (1982), 472–492.
R. Connelly, Rigidity and Energy,Invent. Math.,66 (1982), 11–33.
S.Even,Graph Algorithms, Computer Science Press, 1979.
S. Even andR. E. Tarjan, Computing anst-numbering,Theoret. Comp. Sci.,2 (1976), 339–344.
Z. Galil, Finding the vertex connectivity of graphs,SIAM J. Computing,9 (1980), 197–199
A. W. Ingleton andM. J. Piff, Gammoids and transversal matroids,J. Comb. Theory,B15. (1973), 51–68.
L.Lovász, Combinatorial Problems and Exercises, North-Holland, 1979.
A.Lempel, S.Even and I.Cederbaum, An algorithm for planarity testing of graphs,Theory of Graphs, (1967),International Symposium, Rome, P. Rosensfield ed., 215–232.
H. Perfect, Symmetrized form of P. Hall's theorem on distinct representatives,Quart. J. Math. Oxford,17 (1966), 303–306.
J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities,J. ACM 27,4 (1980), 701–717.
V.Vishkin, Synchronous parallel computation, a survey,TR#71,Department of Computer Science, Courant Institute, NYU, 1983.
W. T. Tutte, How to draw a graph,Proc. London Math. Soc.,13 (1963), 743–768.