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 条
  • [21] A parametric filtering algorithm for the graph isomorphism problem
    Sorlin, Sebastien
    Solnon, Christine
    CONSTRAINTS, 2008, 13 (04) : 518 - 537
  • [22] EFFICIENCY IMPROVEMENT FOR ALGORITHM OF TESTING GRAPH ISOMORPHISM
    KUBO, N
    SHIRAKAWA, I
    OZAKI, H
    ELECTRONICS & COMMUNICATIONS IN JAPAN, 1978, 61 (11): : 18 - 24
  • [23] A Polynomial Time Algorithm for Undirected Graph Isomorphism
    Hou, Aimin
    Hao, Zhifeng
    WORLD CONGRESS ON ENGINEERING, WCE 2011, VOL II, 2011, : 1236 - 1239
  • [24] A randomized parallel algorithm for planar graph isomorphism
    Gazit, H
    Reif, JH
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1998, 28 (02): : 290 - 314
  • [25] On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
    Moore, Cristopher
    Russell, Alexander
    Sniady, Piotr
    STOC 07: PROCEEDINGS OF THE 39TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2007, : 536 - 545
  • [26] ON THE IMPOSSIBILITY OF A QUANTUM SIEVE ALGORITHM FOR GRAPH ISOMORPHISM
    Moore, Cristopher
    Russell, Alexander
    Sniady, Piotr
    SIAM JOURNAL ON COMPUTING, 2010, 39 (06) : 2377 - 2396
  • [27] An algorithm portfolio for the sub-graph isomorphism problem
    Battiti, Roberto
    Mascia, Franco
    ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 106 - +
  • [28] A Quantum Algorithm for the Sub-graph Isomorphism Problem
    Mariella, Nicola
    Simonetto, Andrea
    ACM TRANSACTIONS ON QUANTUM COMPUTING, 2023, 4 (02):
  • [29] A Practical Graph Isomorphism Algorithm with Vertex Canonical Labeling
    Hou, Aimin
    Zhong, Qingqi
    Chen, Yurou
    Hao, Zhifeng
    JOURNAL OF COMPUTERS, 2014, 9 (10) : 2467 - 2474
  • [30] Quantum walk inspired algorithm for graph similarity and isomorphism
    Callum Schofield
    Jingbo B. Wang
    Yuying Li
    Quantum Information Processing, 2020, 19
12345