SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME

被引：0
|
作者：
LINGAS, A
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 210卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：98 / 103
页数：6
相关论文
共 50 条
  • [1] SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME
    LINGAS, A
    THEORETICAL COMPUTER SCIENCE, 1989, 63 (03) : 295 - 302
  • [2] THE SUBGRAPH ISOMORPHISM-PROBLEM FOR OUTERPLANAR GRAPHS
    SYSLO, MM
    THEORETICAL COMPUTER SCIENCE, 1982, 17 (01) : 91 - 97
  • [3] Maximum packing for biconnected outerplanar graphs
    Kovacs, T
    Lingas, A
    DISCRETE APPLIED MATHEMATICS, 2000, 100 (1-2) : 85 - 94
  • [4] Four-searchable biconnected outerplanar graphs
    Diner, Oznur Yasar
    Dyer, Danny
    Yang, Boting
    DISCRETE APPLIED MATHEMATICS, 2022, 306 : 70 - 82
  • [5] Frequent subgraph mining in outerplanar graphs
    Tamás Horváth
    Jan Ramon
    Stefan Wrobel
    Data Mining and Knowledge Discovery, 2010, 21 : 472 - 508
  • [6] Frequent subgraph mining in outerplanar graphs
    Horvath, Tamas
    Ramon, Jan
    Wrobel, Stefan
    DATA MINING AND KNOWLEDGE DISCOVERY, 2010, 21 (03) : 472 - 508
  • [7] Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs
    Zhuang, Bingbing
    Nagamochi, Hiroshi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (02): : 211 - 219
  • [8] TESTING ISOMORPHISM OF OUTERPLANAR GRAPHS IN PARALLEL
    CHLEBUS, BS
    DIKS, K
    RADZIK, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1988, 324 : 220 - 230
  • [9] Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
    Kammer, Frank
    Kratsch, Dieter
    Laudahn, Moritz
    ALGORITHMICA, 2019, 81 (03) : 1180 - 1204
  • [10] Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
    Frank Kammer
    Dieter Kratsch
    Moritz Laudahn
    Algorithmica, 2019, 81 : 1180 - 1204
12345