This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D.Coppersmith and S.Winograd (1982), On the asymptotic complexity of matrix multiplication, SIAM J. Computing, 472–492.
L. Csanky (1976), Fast parallel matrix inversion algorithms, SIAM J. Computing 5, 618–623.
J. Edmonds (1967), Systems of distinct representatives and linear algebra, J. Res. Nat. Bur. Standards Sect. B 71B, 241–247.
S.Even (1979), Graph algorithms, Computer Science Press.
G. Frobenius (1917), Über zerlegbare Determinanten, Sitzungsber. Königl. Preuss. Akad. Wiss. XVIII, 274–277.
Z. Galil (1980), Finding the vertex connectivity of graphs, SIAM J. Computing, 9, 197–199.
M. Grötschel, L. Lovasz and A. Schrijver (1981), The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1, 169–197.
M. Grötschel, L. Lovasz and A. Schrijver (1984), Polynomial algorithms for perfect graphs, Annals of Discrete Math. 21, 325–256.
A.W. Ingleton and M.J. Piff (1973), Gammoids and transversal matroids, J. Comb. Theory B15, 51–68.
R.M. Karp, E. Upfal and A. Wigderson (1986), Constructing a perfect matching is in random NC, Combinatorica 6, 35–48.
P.W. Kasteleyn (1961), The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice, Physica 27, 1209–1225.
N.Linial, L.Lovasz and A.Wigderson (1986a), A physical interpretation of graph connectivity, Proc. 27th Annual Symp. on Found. of Computer Science, IEEE Computer Soc.
N.Linial, L.Lovasz and A.Wigderson (1986b), Rubber bands, convex embeddings, and graph connectivity, Combinatorica (submitted).
L. Lova'sz (1979a), On determinants, matchings, and random algorithms, in: Fundamentals of Computation Theory, FTC' 79 (ed. L. Budach), Akademie-Verlag, Berlin; 565–574.
L. Lovasz (1979b), On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25, 1–7.
L. Lovasz and M.D. Plummer (1986), Matching Theory, Akadėmiai Kiado, Budapest-North-Holland, Amsterdam.
L.Lovasz, M.Saks and A.Schrijver, Connectivity and orthonormal representations of graphs (to be published)
K.Mulmuley, U.Vazirani and V.Vazirani (1986), Matching is as easy as matric inversion, Combinatorica (to appear)
H. Perfect (1966), Symmetrized form of P.Hall's theorem on distinct representatives, Quart. J. Math. Oxford 17, 303–306.
J.T. Schwartz (1980), Fast probabilistic algorithms for verification of polynomial identities, J. ACM 27, 701–717.
W.T. Tutte (1947), The factorization of linear graphs, J. London. Math. Soc. 22, 107–111.
W.T. Tutte (1963), How to draw a graph, Proc. London Math. Soc. 13, 743–768.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lovasz, L. (1986). Connectivity algorithms using rubber bands. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1986. Lecture Notes in Computer Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17179-7_24
Download citation
DOI: https://doi.org/10.1007/3-540-17179-7_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17179-9
Online ISBN: 978-3-540-47239-1
eBook Packages: Springer Book Archive