A UNIFIED APPROACH TO VISIBILITY REPRESENTATIONS OF PLANAR GRAPHS

被引：214

作者：

TAMASSIA, R

TOLLIS, IG

机构：

[1] TEKTRONIX INC,COMP RES LAB,BEAVERTON,OR 97077

[2] UNIV ILLINOIS,DEPT ELECT & COMP ENGN,URBANA,IL 61801

[3] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 1986年 / 1卷 / 04期

关键词：

D O I：

10.1007/BF02187705

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：321 / 341

页数：21

共 18 条

[1]

BONDY JA, 1976, GRAPH THEORY APPLICA

[2] REPRESENTING A PLANAR GRAPH BY VERTICAL LINES JOINING DIFFERENT LEVELS [J].

DUCHET, P ;

HAMIDOUNE, Y ;

VERGNAS, ML ;

MEYNIEL, H .

DISCRETE MATHEMATICS, 1983, 46 (03) :319-321

[3]

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

[4]

Even S., 1979, GRAPH ALGORITHMS

[5] THE HAMILTONIAN CIRCUIT PROBLEM IS POLYNOMIAL FOR 4-CONNECTED PLANAR GRAPHS [J].

GOUYOUBEAUCHAMPS, D .

SIAM JOURNAL ON COMPUTING, 1982, 11 (03) :529-539

[6] EFFICIENT PLANARITY TESTING [J].

HOPCROFT, J ;

TARJAN, R .

JOURNAL OF THE ACM, 1974, 21 (04) :549-568

[7]

Lempel A., 1967, Theory of graphs-international symposium, P215

[8]

LUCCIO F, 1983, UNPUB NOTE VISIBILIT

[9]

MELNIKOV LA, 1981, 6TH HUNG C COMB EG

[10]

Otten R. H. J. M., 1978, Proceedings of the 1978 IEEE International Symposium on Circuits and Systems, P914

← 1 2 →