GRAPH GRAPHICS - THEORY AND PRACTICE

被引：10

作者：

ESPOSITO, C ^{[1
]}

机构：

[1] NEW MEXICO STATE UNIV, DEPT COMP SCI, LAS CRUCES, NM 88003 USA

来源：

关键词：

D O I：

10.1016/0898-1221(88)90208-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：247 / 253

页数：7

共 18 条

[1] A FRAMEWORK FOR SOLVING VLSI GRAPH LAYOUT PROBLEMS [J].

BHATT, SN ;

LEIGHTON, FT .

BOOTH, KS ;

LUEKER, GS .

[3]

Dearholt D. W., 1985, MCCS8514 NEW MEX STA

[4]

EADES P, 1984, 52 U QUEENSL DEP COM

[5]

EADES P, 1984, UNPUB HEURISTIC GRAP

[6]

Even S., 1976, Theoretical Computer Science, V2, P339, DOI 10.1016/0304-3975(76)90086-4

[7] CROSSING NUMBER IS NP-COMPLETE [J].

GAREY, MR ;

JOHNSON, DS .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (03) :312-316

[8]

GOLDSTEIN AJ, 1963, P GRAPH COMBINATORIC

[9]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.1201/9780429493768

[10] EFFICIENT PLANARITY TESTING [J].

HOPCROFT, J ;

TARJAN, R .