RUBBER BANDS, CONVEX EMBEDDINGS AND GRAPH CONNECTIVITY

被引：48

作者：

LINIAL, N

LOVASZ, L

WIGDERSON, A

机构：

[1] HEBREW UNIV JERUSALEM, JERUSALEM, ISRAEL

[2] MATH SCI RES INST, BERKELEY, CA 94720 USA

[3] EOTVOS LORAND UNIV, H-1088 BUDAPEST, HUNGARY

来源：

关键词：

D O I：

10.1007/BF02122557

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：91 / 102

页数：12

共 15 条

[1]

Aho AV., 1975, DESIGN ANAL COMPUTER

[2]

BERKOWITZ S, 1984, INFORM P LET, V518, P147

[3]

BIRKHOFF G, 1970, SURVEY MODERN ALGEBR

[4] RIGIDITY AND ENERGY [J].

CONNELLY, R .

[5] ON THE ASYMPTOTIC COMPLEXITY OF MATRIX MULTIPLICATION [J].

COPPERSMITH, D ;

WINOGRAD, S .

[6]

Even S., 1976, Theoretical Computer Science, V2, P339, DOI 10.1016/0304-3975(76)90086-4

[7]

Even S., 1979, GRAPH ALGORITHMS

[8] FINDING THE VERTEX CONNECTIVITY OF GRAPHS [J].

GALIL, Z .

[9]

Ingleton A. W., 1973, Journal of Combinatorial Theory, Series B, V15, P51, DOI 10.1016/0095-8956(73)90031-2

[10]

Lempel A., 1967, Theory of graphs-international symposium, P215