Parallel algorithm for testing isomorphism of undirected graphs

被引：0
|
作者：
Chen, Ling
Yin, Xinchun
机构：
来源：
Jisuanji Gongcheng/Computer Engineering | 2002年 / 28卷 / 06期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [31] A FASTER ALGORITHM TO RECOGNIZE UNDIRECTED PATH GRAPHS
    SCHAFFER, AA
    DISCRETE APPLIED MATHEMATICS, 1993, 43 (03) : 261 - 295
  • [32] An algorithm for generating minimal cutsets of undirected graphs
    Yong Yeon Shin
    Jai Sang Koh
    Korean Journal of Computational & Applied Mathematics, 1998, 5 (3): : 681 - 693
  • [33] EFFICIENT ALGORITHM FOR ISOMORPHISM OF 2 GRAPHS
    SAUCIER, G
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1971, 5 (NR3): : 39 - &
  • [34] Network Design on Undirected Series-Parallel Graphs
    Bansal, Ishan
    Mao, Ryan
    Misra, Avhan
    COMBINATORIAL OPTIMIZATION, ISCO 2024, 2024, 14594 : 277 - 288
  • [35] A heuristic algorithm of recognition of isomorphism of graphs
    Glibovets N.N.
    Ivashchenko S.A.
    Cybernetics and Systems Analysis, 2001, 37 (1) : 138 - 143
  • [36] A parallel algorithm for labeled graph isomorphism
    Abdulrahim, M
    Misra, M
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 1373 - 1380
  • [37] Isomorphism Testing for Graphs of Bounded Rank Width
    Grohe, Martin
    Schweitzer, Pascal
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 1010 - 1029
  • [38] AN ASYNCHRONOUS PARALLEL ALGORITHM FOR UNDIRECTED GRAPH CONNECTIVITY
    COLE, R
    ZAJICEK, O
    JOURNAL OF ALGORITHMS, 1995, 18 (01) : 50 - 97
  • [39] Isomorphism Testing for Graphs Excluding Small Minors
    Grohe, Martin
    Wiebking, Daniel
    Neuen, Daniel
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 625 - 636
  • [40] Isomorphism testing for circulant graphs Cn(a, b)
    Nicoloso, Sara
    Pietropaoli, Ugo
    UTILITAS MATHEMATICA, 2012, 87 : 165 - 182
12345