ALGORITHMS AND DATA-STRUCTURES FOR AN EXPANDED FAMILY OF MATROID INTERSECTION PROBLEMS

被引：11

作者：

FREDERICKSON, GN ^{[1
]}

SRINIVAS, MA ^{[1
]}

机构：

[1] CALIF STATE POLYTECH UNIV POMONA,DEPT COMP SCI,POMONA,CA 91768

来源：

SIAM JOURNAL ON COMPUTING | 1989年 / 18卷 / 01期

关键词：

D O I：

10.1137/0218008

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：112 / 138

页数：27

共 15 条

[1]

Boruvka O., 1926, PRACE MORAVSKE PRIRO, V3, P37

[2] 2 ALGORITHMS FOR WEIGHTED MATROID INTERSECTION [J].

BREZOVEC, C ;

CORNUEJOLS, G ;

GLOVER, F .

MATHEMATICAL PROGRAMMING, 1986, 36 (01) :39-53

[3]

BREZOVEC C, IN PRESS MATH PROG B

[4] DATA-STRUCTURES FOR ONLINE UPDATING OF MINIMUM SPANNING-TREES, WITH APPLICATIONS [J].

FREDERICKSON, GN .

SIAM JOURNAL ON COMPUTING, 1985, 14 (04) :781-798

[5]

FREDERICKSON GN, 1984, INOFRM COMPUT, V74, P113

[6] FIBONACCI HEAPS AND THEIR USES IN IMPROVED NETWORK OPTIMIZATION ALGORITHMS [J].

FREDMAN, ML ;

TARJAN, RE .

JOURNAL OF THE ACM, 1987, 34 (03) :596-615

[7]

Gabow H. N., 1985, P 12 INT C AUT LANG, P210

[8] EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING-TREES IN UNDIRECTED AND DIRECTED-GRAPHS [J].

GABOW, HN ;

GALIL, Z ;

SPENCER, T ;

TARJAN, RE .

COMBINATORICA, 1986, 6 (02) :109-122

[9] EFFICIENT ALGORITHMS FOR A FAMILY OF MATROID INTERSECTION PROBLEMS [J].

GABOW, HN ;

TARJAN, RE .

JOURNAL OF ALGORITHMS, 1984, 5 (01) :80-131

[10]

Garey MR., 1979, COMPUTERS INTRACTABI

← 1 2 →