MOST AND LEAST UNIFORM SPANNING-TREES

被引：29

作者：

CAMERINI, PM

MAFFIOLI, F

MARTELLO, S

TOTH, P

机构：

[1] POLITECN MILAN,DIPARTIMENTO ELETTR,I-20133 MILAN,ITALY

[2] UNIV BOLOGNA,DIPARTIMENTO ELETTR INFORMAT & SISTEMIST,I-40126 BOLOGNA,ITALY

来源：

DISCRETE APPLIED MATHEMATICS | 1986年 / 15卷 / 2-3期

关键词：

D O I：

10.1016/0166-218X(86)90041-7

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：181 / 197

页数：17

共 17 条

[1]

Aho A.V., 1983, DATA STRUCTURES ALGO

[2] THE BOUNDED PATH TREE PROBLEM [J].

CAMERINI, PM ;

GALBIATI, G .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1982, 3 (04) :474-484

[3] COMPLEXITY OF SPANNING TREE PROBLEMS .1. [J].

CAMERINI, PM ;

GALBIATI, G ;

MAFFIOLI, F .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1980, 5 (05) :346-352

[4] THE K BEST SPANNING ARBORESCENCES OF A NETWORK [J].

CAMERINI, PM ;

FRATTA, L ;

MAFFIOLI, F .

NETWORKS, 1980, 10 (02) :91-109

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

CAMERINI, PM ;

FRATTA, L ;

MAFFIOLI, F .

NETWORKS, 1979, 9 (04) :309-312

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

CAMERINI, PM .

INFORMATION PROCESSING LETTERS, 1978, 7 (01) :10-14

[7]

CAMERINI PM, 1983, IEELCE834 REP

[8]

CARPANETO G, 1984, OPER RES, V39, P380

[9] OPTIMUM LOCATIONS OF SWITCHING CENTERS + ABSOLUTE CENTERS + MEDIANS OF GRAPH [J].

HAKIMI, SL .

OPERATIONS RESEARCH, 1964, 12 (03) :450-&

[10]

Kruskal J. B., 1956, P AM MATH SOC, V7, P48, DOI [10.2307/2033241, DOI 10.1090/S0002-9939-1956-0078686-7]

← 1 2 →