SUBGRAPH ISOMORPHISM FOR BICONNECTED OUTERPLANAR GRAPHS IN CUBIC TIME

被引:0
|
作者
LINGAS, A
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:98 / 103
页数:6
相关论文
共 50 条
  • [21] A simple O(log N) time parallel algorithm for testing isomorphism of maximal outerplanar graphs
    Sen Gupta, S
    Sinha, BP
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1999, 56 (02) : 144 - 155
  • [22] Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
    Heggernes, Pinar
    Meister, Daniel
    Villanger, Yngve
    ALGORITHMS AND COMPUTATION, PT 2, 2010, 6507 : 399 - +
  • [23] A Novel Approach for Subgraph Isomorphism Problem on Bipartite Graphs
    Koca, Mehmet Burak
    Sevilgen, Fatih Erdogan
    2019 27TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2019,
  • [24] Approach for efficient subgraph isomorphism testing for multiple graphs
    Zhang S.
    Li J.-Z.
    Gao H.
    Zou Z.-N.
    Ruan Jian Xue Bao/Journal of Software, 2010, 21 (03): : 401 - 414
  • [25] Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces
    Bonsma, Paul
    29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 531 - 542
  • [26] Polynomial-time algorithms for SUBGRAPH ISOMORPHISM in small graph classes of perfect graphs
    Konagaya, Matsuo
    Otachi, Yota
    Uehara, Ryuhei
    DISCRETE APPLIED MATHEMATICS, 2016, 199 : 37 - 45
  • [27] Polynomial-Time Algorithms for SUBGRAPH ISOMORPHISM in Small Graph Classes of Perfect Graphs
    Konagaya, Matsuo
    Otachi, Yota
    Uehara, Ryuhei
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION (TAMC 2014), 2014, 8402 : 216 - 228
  • [28] Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time
    Diks, Krzysztof
    Stanczyk, Piotr
    SOFSEM 2010: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2010, 5901 : 321 - 333
  • [29] Recursive formulas for embedding distributions of cubic outerplanar graphs
    Chen, Yichao
    Wang, Tao
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2017, 68 : 131 - 146
  • [30] A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem
    Manku, GS
    INFORMATION PROCESSING LETTERS, 1996, 59 (01) : 1 - 7