A FAST ALGORITHM FOR THE DECOMPOSITION OF GRAPHS AND POSETS

被引：47

作者：

BUER, H

MOHRING, RH

机构：

来源：

关键词：

D O I：

10.1287/moor.8.2.170

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：170 / 184

页数：15

共 40 条

[1]

ARDITTI JC, 1978, P C INT CNRS PROBLEM

[2]

ASHBACHER M, 1976, P AM MATH SOC, V54, P468

[3]

Balas E., 1977, Networks, V7, P267, DOI 10.1002/net.3230070307

[4]

BIRNBAUM ZW, 1965, SIAM J APPL MATH, V13, P444

[5]

Blass A., 1978, J GRAPH THEOR, V2, P19

[6] TREE DECOMPOSITION ALGORITHM FOR LARGE NETWORKS [J].

BLEWETT, WJ ;

HU, TC .

[7]

Bollobas B., 1978, EXTREMAL GRAPH THEOR

[8]

BUER H, 1980, OPER RES VERFAHREN, V37, P259

[9] CERTAIN POLYTOPES ASSOCIATED WITH GRAPHS [J].

CHVATAL, V .

[10] DECOMPOSITION OF DIRECTED-GRAPHS [J].

CUNNINGHAM, WH .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (02) :214-228