{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T14:41:50Z","timestamp":1771944110256,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1007\/bf02122557","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T06:29:39Z","timestamp":1130567379000},"page":"91-102","source":"Crossref","is-referenced-by-count":53,"title":["Rubber bands, convex embeddings and graph connectivity"],"prefix":"10.1007","volume":"8","author":[{"given":"N.","family":"Linial","sequence":"first","affiliation":[]},{"given":"L.","family":"Lov\u00e1sz","sequence":"additional","affiliation":[]},{"given":"A.","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02122557_CR1","unstructured":"A. V.Aho J. E.Hopcropt and J. D.Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, 1975."},{"key":"BF02122557_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(84)90018-8","volume":"18","author":"S. Berkowitz","year":"1984","unstructured":"S. Berkowitz, On computing the determinant in small parallel time using a small number of processors,Inform. Proc. Let.,18 (1984), 147\u2013150.","journal-title":"Inform. Proc. Let."},{"key":"BF02122557_CR3","unstructured":"G.Birkhoff and S.MacLane,A Survey of Modern Algebra, MacMillan, 1970."},{"key":"BF02122557_CR4","doi-asserted-by":"crossref","unstructured":"D.Coppersmith and S.Winograd, On the asymptotic complexity of matrix multiplication,SIAM J. Computing, (1982), 472\u2013492.","DOI":"10.1137\/0211038"},{"key":"BF02122557_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01404753","volume":"66","author":"R. Connelly","year":"1982","unstructured":"R. Connelly, Rigidity and Energy,Invent. Math.,66 (1982), 11\u201333.","journal-title":"Invent. Math."},{"key":"BF02122557_CR6","unstructured":"S.Even,Graph Algorithms, Computer Science Press, 1979."},{"key":"BF02122557_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"S. Even andR. E. Tarjan, Computing anst-numbering,Theoret. Comp. Sci.,2 (1976), 339\u2013344.","journal-title":"Theoret. Comp. Sci."},{"key":"BF02122557_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0209016","volume":"9","author":"Z. Galil","year":"1980","unstructured":"Z. Galil, Finding the vertex connectivity of graphs,SIAM J. Computing,9 (1980), 197\u2013199","journal-title":"SIAM J. Computing"},{"key":"BF02122557_CR9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0095-8956(73)90031-2","volume":"B15","author":"A. W. Ingleton","year":"1973","unstructured":"A. W. Ingleton andM. J. Piff, Gammoids and transversal matroids,J. Comb. Theory,B15. (1973), 51\u201368.","journal-title":"J. Comb. Theory"},{"key":"BF02122557_CR10","unstructured":"L.Lov\u00e1sz, Combinatorial Problems and Exercises, North-Holland, 1979."},{"key":"BF02122557_CR11","unstructured":"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\u2013232."},{"key":"BF02122557_CR12","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1093\/qmath\/17.1.303","volume":"17","author":"H. Perfect","year":"1966","unstructured":"H. Perfect, Symmetrized form of P. Hall's theorem on distinct representatives,Quart. J. Math. Oxford,17 (1966), 303\u2013306.","journal-title":"Quart. J. Math. Oxford"},{"key":"BF02122557_CR13","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","volume":"4","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities,J. ACM 27,4 (1980), 701\u2013717.","journal-title":"J. ACM 27"},{"key":"BF02122557_CR14","unstructured":"V.Vishkin, Synchronous parallel computation, a survey,TR#71,Department of Computer Science, Courant Institute, NYU, 1983."},{"key":"BF02122557_CR15","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","volume":"13","author":"W. T. Tutte","year":"1963","unstructured":"W. T. Tutte, How to draw a graph,Proc. London Math. Soc.,13 (1963), 743\u2013768.","journal-title":"Proc. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122557.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02122557\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:22:27Z","timestamp":1557796947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02122557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["BF02122557"],"URL":"https:\/\/doi.org\/10.1007\/bf02122557","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}