COMPLEXITY OF SPANNING TREE PROBLEMS .1.

被引：40

作者：

CAMERINI, PM

GALBIATI, G

MAFFIOLI, F

机构：

[1] POLITECN MILAN,IST ELETTROTECN & ELETTRON,I-20133 MILAN,ITALY

[2] UNIV PAVIA,IST MATEMAT,I-27100 PAVIA,ITALY

来源：

关键词：

D O I：

10.1016/0377-2217(80)90164-2

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：346 / 352

页数：7

共 14 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER

[2]

[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047

[3] MIN-MAX SPANNING TREE PROBLEM AND SOME EXTENSIONS [J].

CAMERINI, PM .

[4]

CAMERINI PM, 1979, 17TH P ALL C

[5]

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

[6]

Christofides N., 1975, GRAPH THEORY ALGORIT

[7]

Dijkstra E., 1959, NUMER MATH, V1, P269

[8]

Garey M.R., 1979, COMPUTERS INTRACTABI

[9] COMPLEXITY OF NETWORK DESIGN PROBLEM [J].

JOHNSON, DS ;

LENSTRA, JK ;

RINNOOYKAN, AHG .

[10]

Karp Richard M., 1972, COMPLEXITY COMPUTER, P85