EFFICIENT ALGORITHMS FOR A FAMILY OF MATROID INTERSECTION PROBLEMS

被引：57

作者：

GABOW, HN

TARJAN, RE

机构：

[1] UNIV COLORADO,DEPT COMP SCI,BOULDER,CO 80309

[2] STANFORD UNIV,DEPT COMP SCI,STANFORD,CA 94305

来源：

关键词：

D O I：

10.1016/0196-6774(84)90042-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：80 / 131

页数：52

共 35 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9

[3]

BOAS PV, 1977, MATH SYST THEORY, V10, P99

[4]

Brylawski T. H., 1973, Discrete Mathematics, V6, P333, DOI 10.1016/0012-365X(73)90064-2

[5] NOTE ON FINDING OPTIMUM BRANCHINGS [J].

CAMERINI, PM ;

FRATTA, L ;

MAFFIOLI, F .

[6]

Cheriton D., 1976, SIAM Journal on Computing, V5, P724, DOI 10.1137/0205051

[7] OPTIMUM BRANCHINGS [J].

EDMONDS, J .

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

[8]

FREDMAN M, UNPUB FIBONACAI LEAP

[9]

FRIEDMAN N, 1972, 13TH P IEEE S SWITCH, P139

[10]

Gabow H. N., 1979, 20th Annual Symposium of Foundations of Computer Science, P196, DOI 10.1109/SFCS.1979.14