PARALLEL RECOGNITION OF OUTERPLANAR GRAPHS

被引:0
|
作者
DIKS, K [1 ]
机构
[1] SLOVAK ACAD SCI,INST TECH CYBERNET,CS-80936 BRATISLAVA,CZECHOSLOVAKIA
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:105 / 113
页数:9
相关论文
共 50 条
  • [1] TESTING ISOMORPHISM OF OUTERPLANAR GRAPHS IN PARALLEL
    CHLEBUS, BS
    DIKS, K
    RADZIK, T
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 220 - 230
  • [2] On the Maximum Number of Cycles in Outerplanar and Series–Parallel Graphs
    Anna de Mier
    Marc Noy
    [J]. Graphs and Combinatorics, 2012, 28 : 265 - 275
  • [3] Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
    Therese Biedl
    [J]. Discrete & Computational Geometry, 2011, 45 : 141 - 160
  • [4] Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
    Biedl, Therese
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2011, 45 (01) : 141 - 160
  • [5] OPTIMAL PARALLEL ALGORITHMS FOR TESTING ISOMORPHISM OF TREES AND OUTERPLANAR GRAPHS
    LEVCOPOULOS, C
    LINGAS, A
    PETERSSON, O
    RYTTER, W
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 472 : 204 - 214
  • [6] On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
    Bernasconi, Nicla
    Panagiotou, Konstantinos
    Steger, Angelika
    [J]. APPROXIMATION RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, PROCEEDINGS, 2008, 5171 : 303 - 316
  • [7] On the Maximum Number of Cycles in Outerplanar and Series-Parallel Graphs
    de Mier, Anna
    Noy, Marc
    [J]. GRAPHS AND COMBINATORICS, 2012, 28 (02) : 265 - 275
  • [8] OUTERPLANAR GRAPHS
    MARTINOV, NJ
    [J]. DOKLADI NA BOLGARSKATA AKADEMIYA NA NAUKITE, 1978, 31 (03): : 265 - 267
  • [9] Linear-time recognition of map graphs with outerplanar witness
    Mnich, Matthias
    Rutter, Ignaz
    Schmidt, Jens M.
    [J]. DISCRETE OPTIMIZATION, 2018, 28 : 63 - 77
  • [10] Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
    Kammer, Frank
    Kratsch, Dieter
    Laudahn, Moritz
    [J]. ALGORITHMICA, 2019, 81 (03) : 1180 - 1204