AUTOMATIC REPRESENTATION OF A PLANAR GRAPH AS A PLANE STRAIGHT LINE GRAPH

被引:2
作者
KOPPE, R [1 ]
机构
[1] PHILIPS FORSCH LAB HAMBURG GMBH,HAMBURG 2000,WEST GERMANY
关键词
D O I
10.1007/BF02242244
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:317 / 333
页数:17
相关论文
共 11 条
[1]   DAS TOPOLOGISCHE PROBLEM DER GEDRUCKTEN SCHALTUNG UND SEINE LOSUNG [J].
BADER, W .
ARCHIV FUR ELEKTROTECHNIK, 1964, 49 (01) :2-&
[2]  
Demoucron G., 1964, REV FRANC RECH OPER, V8, P33
[3]  
Fary I., 1948, ACTA SCI MATH SZEGED, V11, P229
[4]   COMPUTER RECOGNITION AND EXTRACTION OF PLANAR GRAPHS FROM INCIDENCE MATRIX [J].
FISHER, GJ ;
WING, O .
IEEE TRANSACTIONS ON CIRCUIT THEORY, 1966, CT13 (02) :154-&
[5]  
HOPCROFT JR, 1971, PLANARITY TESTING V
[6]  
HOPE AK, 1971, SOFTWARE PRACTICE EX, V1, P82
[7]   AN ALGORITHMIC CRITERION OF PLANARITY [J].
KLEMM, U .
COMPUTING, 1968, 3 (04) :245-&
[8]   AN ALGORITHMIC PLANARITY CRITERION [J].
KLEMM, U .
COMPUTING, 1968, 3 (03) :194-&
[9]  
STOJAKOVIC M, 1959, NOVUM SADU, V4, P375
[10]  
Tutte W., 1963, P LOND MATH SOC, P743, DOI DOI 10.1112/PLMS/S3-13.1.743