GRAPH BISECTION ALGORITHMS WITH GOOD AVERAGE CASE BEHAVIOR

被引：176

作者：

BUI, TN

CHAUDHURI, S

LEIGHTON, FT

SIPSER, M

机构：

[1] MIT, DEPT ELECT ENGN & COMP SCI, CAMBRIDGE, MA 02139 USA

[2] MIT, DEPT MATH, CAMBRIDGE, MA 02139 USA

[3] MIT, COMP SCI LAB, CAMBRIDGE, MA 02139 USA

来源：

COMBINATORICA | 1987年 / 7卷 / 02期

关键词：

D O I：

10.1007/BF02579448

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：171 / 191

页数：21

共 21 条

[1]

[Anonymous], 1980, EUROPEAN J COMBIN, DOI [DOI 10.1016/S0195-6698(80)80030-8, 10.1016/S0195-6698(80)80030-8]

[2]

BAKER B, 1983, FOCS, P265

[3]

BARNES ER, PARTITIONING SPECTRA

[4]

BARNES ER, 1981, IBM RC8690 TECHN REP

[5]

BHATT SN, 1984, J COMPUTER SYSTEM SC, V28

[6] THE DIAMETER OF RANDOM REGULAR GRAPHS [J].

BOLLOBAS, B ;

DELAVEGA, WF .

COMBINATORICA, 1982, 2 (02) :125-134

[7]

BREUER MA, 1977, J DES AUTOM FAULT, V1, P343

[8] LOWER BOUNDS FOR PARTITIONING OF GRAPHS [J].

DONATH, WE ;

HOFFMAN, AJ .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (05) :420-425

[9]

Fiduccia CM, 1982, 19TH P DES AUT C, P175, DOI DOI 10.1109/DAC.1982.1585498

[10]

Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1

← 1 2 3 →