MATCHING IS AS EASY AS MATRIX-INVERSION

被引：329

作者：

MULMULEY, K

VAZIRANI, UV

VAZIRANI, VV

机构：

[1] UNIV CALIF BERKELEY,DEPT COMP SCI,BERKELEY,CA 94720

[2] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853

[3] MATH SCI RES INST,BERKELEY,CA 94720

来源：

COMBINATORICA | 1987年 / 7卷 / 01期

关键词：

D O I：

10.1007/BF02579206

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：105 / 113

页数：9

共 20 条

[1] PARALLEL COMPUTATION FOR WELL-ENDOWED RINGS AND SPACE-BOUNDED PROBABILISTIC MACHINES [J].

BORODIN, A ;

COOK, S ;

PIPPENGER, N .

INFORMATION AND CONTROL, 1983, 58 (1-3) :113-136

[2] A TAXONOMY OF PROBLEMS WITH FAST PARALLEL ALGORITHMS [J].

COOK, SA .

INFORMATION AND CONTROL, 1985, 64 (1-3) :2-22

[3]

Csanky L., 1976, SIAM Journal on Computing, V5, P618, DOI 10.1137/0205040

[4] SYSTEMS OF DISTINCT REPRESENTATIVES AND LINEAR ALGEBRA [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04) :241-+

[5] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[6]

Galil Z., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P490, DOI 10.1109/SFCS.1985.33

[7] A LAS-VEGAS RNC ALGORITHM FOR MAXIMUM MATCHING [J].

KARLOFF, HJ .

COMBINATORICA, 1986, 6 (04) :387-391

[8]

KARP RM, 1985, 17TH P ANN ACM S THE, P22

[9]

KOZEN D, 1985, 5TH ANN F SOFTW TECH

[10]

Lovasz L., 1986, ANN DISCRETE MATH

← 1 2 →