A graph isomorphism algorithm using pseudoinverses

被引:0
|
作者
Bennett, JM
Edwards, JJ
机构
[1] UNIV SYDNEY,BASSER DEPT COMP SCI,SYDNEY,NSW 2006,AUSTRALIA
[2] UNIV TECHNOL SYDNEY,SCH COMP SCI,SYDNEY,NSW 2007,AUSTRALIA
来源
BIT | 1996年 / 36卷 / 01期
关键词
graph isomorphism; pseudoinverse;
D O I
10.1007/BF01740543
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
For a graph of m nodes and n edges, an algorithm for testing the isomorphism of graphs is given. The complexity of the algorithm is a maximum of O(mn(2)) in almost all cases, with a considerable reduction if sparsity is exploited. If isomorphism is present, the pseudoinverses of the Laplace matrices of the graphs will be row and column permutations of each other. Advantage can be taken of certain features of the incidence matrices or of properties of the graphs to reduce computation time.
引用
收藏
页码:41 / 53
页数:13
相关论文
共 50 条
  • [41] Parallel organization algorithm for graph matching and subgraph isomorphism detection
    Nakanishi, Y
    Uehara, K
    DISCOVERY SCIENCE, 1998, 1532 : 407 - 408
  • [42] ALGORITHM FOR GRAPH ISOMORPHISM AND ITS APPLICATION TO THE IDENTIFICATION OF THE LOGICAL NETWORKS
    KIKUST, PB
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1979, (04): : 21 - 27
  • [43] A polynomial-time algorithm for simple undirected graph isomorphism
    He, Jing
    Chen, Jinjun
    Huang, Guangyan
    Cao, Jie
    Zhang, Zhiwang
    Zheng, Hui
    Zhang, Peng
    Zarei, Roozbeh
    Sansoto, Ferry
    Wang, Ruchuan
    Ji, Yimu
    Fan, Weibei
    Xie, Zhijun
    Wang, Xiancheng
    Guo, Mengjiao
    Chi, Chi-Hung
    de Souza, Paulo A.
    Zhang, Jiekui
    Li, Youtao
    Chen, Xiaojun
    Shi, Yong
    Green, David
    Kersi, Taraporewalla
    Van Zundert, Andre
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2021, 33 (07):
  • [44] Accelarating graph isomorphism algorithm by finer classification of layered graphs
    Fukuda, K
    Nakamori, M
    PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 1271 - 1276
  • [45] ON GRAPH ISOMORPHISM AND GRAPH AUTOMORPHISM
    ZIVKOVIC, TP
    JOURNAL OF MATHEMATICAL CHEMISTRY, 1991, 8 (1-3) : 19 - 37
  • [46] GRAPH ISOMORPHISM - HEURISTIC EDGE-PARTITIONING-ORIENTED ALGORITHM
    LEVI, G
    COMPUTING, 1974, 12 (04) : 291 - 313
  • [47] RETRACTED: A Dynamic Mapping Algorithm for Graph Isomorphism (Retracted Article)
    Tian, Lijun
    Liu, Chaoqun
    Xie, Jianquan
    2011 INTERNATIONAL CONFERENCE ON ENERGY AND ENVIRONMENTAL SCIENCE-ICEES 2011, 2011, 11 : 1172 - 1178
  • [48] An Algorithm for Testing Isomorphism of Planer Graph Based on Distant Matrix
    Wu, Yanpeng
    Liu, Shuiqiang
    EMERGING MATERIALS AND MECHANICS APPLICATIONS, 2012, 487 : 317 - 321
  • [49] Advanced Datapath Synthesis using Graph Isomorphism
    Yu, Cunxi
    Choudhury, Mihir
    Sullivan, Andrew
    Ciesielski, Maciej
    2017 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2017, : 424 - 429
  • [50] ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
    Kutz, Martin
    Schweitzer, Pascal
    PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 150 - 157