NP-COMPLETENESS FOR MINIMIZING MAXIMUM EDGE LENGTH IN GRID EMBEDDINGS

被引：12

作者：

MILLER, Z

ORLIN, JB

机构：

[1] MIAMI UNIV,DEPT MATH & STAT,OXFORD,OH 45056

[2] MIT,ALFRED P SLOAN SCH MANAGEMENT,CAMBRIDGE,MA 02139

来源：

JOURNAL OF ALGORITHMS | 1985年 / 6卷 / 01期

关键词：

D O I：

10.1016/0196-6774(85)90016-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：10 / 16

页数：7

相关论文

共 18 条

[1] THE BANDWIDTH OF CATERPILLARS WITH HAIRS OF LENGTH 1 AND 2
ASSMANN, SF
PECK, GW
SYSLO, MM
ZAK, J
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1981, 2 (04): : 387 - 393
[2] Behzad M., 1979, GRAPHS DIGRAPHS
[3] BHATT S, UNPUB COMPLEXITY MIN
[4] BHATT S, UNPUB MINIMIZING LON
[5] THE BANDWIDTH PROBLEM FOR GRAPHS AND MATRICES - A SURVEY
CHINN, PZ
CHVATALOVA, J
DEWDNEY, AK
GIBBS, NE
[J]. JOURNAL OF GRAPH THEORY, 1982, 6 (03) : 223 - 254
[6] CHUNG FRK, UNPUB GRAPH LABELING
[7] CHVATALOVA J, 1980, THESIS U WATERLOO
[8] COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION
GAREY, MR
GRAHAM, RL
JOHNSON, DS
KNUTH, DE
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1978, 34 (03) : 477 - 495
[9] GURARI E, 1981, 19TH P ANN ALL C COM
[10] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364