FINDING THE 2-CORE OF A TREE

被引：15

作者：

BECKER, RI

PERL, Y

机构：

[1] UNIV TENNESSEE,DEPT MATH,KNOXVILLE,TN 37996

[2] RUTGERS STATE UNIV,DEPT COMP SCI,NEW BRUNSWICK,NJ 08903

[3] BAR ILAN UNIV,RAMAT GAN,ISRAEL

来源：

DISCRETE APPLIED MATHEMATICS | 1985年 / 11卷 / 02期

关键词：

D O I：

10.1016/S0166-218X(85)80002-0

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：103 / 113

页数：11

共 11 条

[1]

[Anonymous], 1979, Computers and Intractibility

[2]

[Anonymous], 1972, Graph Theory

[3]

FLAJOLET P, 1981, INRIA56 RAPP RECH

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

HAKIMI, SL .

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

[5] LINEAR ALGORITHMS FOR FINDING THE JORDAN CENTER AND PATH CENTER OF A TREE [J].

HEDETNIEMI, SM ;

COCKAYNE, EJ ;

HEDETNIEMI, ST .

TRANSPORTATION SCIENCE, 1981, 15 (02) :98-114

[6] ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .2. P-MEDIANS [J].

KARIV, O ;

HAKIMI, SL .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1979, 37 (03) :539-560

[7]

Knuth D. E., 1968, The art of computer programming, V1

[8]

Morgan CA, 1980, J ALGORITHMS, V1, P247, DOI [10.1016/0196-6774(80)90012-7, DOI 10.1016/0196-6774(80)90012-7]

[9]

Renyi A, 1967, J AUSTRAL MATH SOC, V7, P497, DOI DOI 10.1017/S1446788700004432

[10] LOCATING CENTRAL PATHS IN A GRAPH [J].

SLATER, PJ .

TRANSPORTATION SCIENCE, 1982, 16 (01) :1-18

← 1 2 →