EXACT ARBORESCENCES, MATCHINGS AND CYCLES

被引：46

作者：

BARAHONA, F

PULLEYBLANK, WR

机构：

[1] Univ of Waterloo, Waterloo, Ont, Can, Univ of Waterloo, Waterloo, Ont, Can

来源：

DISCRETE APPLIED MATHEMATICS | 1987年 / 16卷 / 02期

关键词：

CYCLES - EXACT ARBORESCENCES - MATCHINGS;

D O I：

10.1016/0166-218X(87)90067-9

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

(Edited Abstract)

引用

页码：91 / 99

页数：9

共 13 条

[1]

[Anonymous], 1967, GRAPH THEORY THEORET

[2]

BARAHONA F, 1981, BALANCING SIGNED TOR

[3]

Bock, 1971, DEV OPERATIONS RES, P29

[4] MATRIX TREE THEOREMS [J].

CHAIKEN, S ;

KLEITMAN, DJ .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1978, 24 (03) :377-381

[5]

CHU Y, 1965, SCI SINICA, V4, P1396

[6] OPTIMUM BRANCHINGS [J].

EDMONDS, J .

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

[7] 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-+

[8]

Fulkerson D. R., 1974, Mathematical Programming, V6, P1, DOI 10.1007/BF01580218

[9] GOOD ALGORITHM FOR SMALLEST SPANNING TREES WITH A DEGREE CONSTRAINT [J].

GABOW, HN .

NETWORKS, 1978, 8 (03) :201-208

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

GABOW, HN ;

TARJAN, RE .

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

← 1 2 →