A heuristic algorithm of recognition of isomorphism of graphs

被引：0
|
作者：
Glibovets N.N. [1 ]
Ivashchenko S.A. [1 ]
机构：
[1] National University Kievo-Mogilyanskaya Akademiya, Kiev
来源：
Cybernetics and Systems Analysis | 2001年 / 37卷 / 1期
关键词：
Graph isomorphism; Heuristic algorithm; Recognition of isomorphism of graphs;
D O I：
10.1023/A:1016632503967
中图分类号：
学科分类号：
摘要：
A heuristic polynomial algorithm is presented, which is used for the recognition of isomorphism of graphs and can be assigned to the group of methods that use local characteristic invariants of graphs. At each step, the behavior of the algorithm depends on information obtained at its previous steps. All the theorems stated are proved for a class of nonoriented graphs. © 2001 Kluwer Academic/Plenum Publishers.
引用
收藏
页码：138 / 143
页数：5
相关论文
共 50 条
  • [41] A heuristic search algorithm for Hamiltonian circuit problems in directed graphs
    Jin, Dawei
    Li, QingQin
    Lu, Min
    WIRELESS NETWORKS, 2022, 28 (02) : 979 - 989
  • [42] A heuristic search algorithm for Hamiltonian circuit problems in directed graphs
    Dawei Jin
    QingQin Li
    Min Lu
    Wireless Networks, 2022, 28 : 979 - 989
  • [43] A SIMPLE AND FAST HEURISTIC ALGORITHM FOR EDGE-COLORING OF GRAPHS
    Fiol, M. A.
    Vilaltella, J.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2013, 10 (03) : 263 - 272
  • [44] Heuristic sampling for the subgraph isomorphism problem
    Cibej, Uros
    Mihelic, Jurij
    2017 IEEE 14TH INTERNATIONAL SCIENTIFIC CONFERENCE ON INFORMATICS, 2017, : 57 - 62
  • [45] A New Algorithm for Isomorphism Determination of Undirected Graphs-Circuit Simulation Method
    Shang, Huiliang
    Li, Feng
    Tang, XianDing
    Woo, Peng-Yung
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 2011, 30 (05) : 1115 - 1130
  • [46] A New Algorithm for Isomorphism Determination of Undirected Graphs-Circuit Simulation Method
    Huiliang Shang
    Feng Li
    XianDing Tang
    Peng-Yung Woo
    Circuits, Systems, and Signal Processing, 2011, 30 : 1115 - 1130
  • [47] Isomorphism testing algorithm for arbitrary graphs-the eigenvector-based method
    Department of Electronic Engineering, Fudan University, Shanghai 200433, China
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao, 2007, 2 (163-167): : 163 - 167
  • [48] FAST BACKTRACKING ALGORITHM TO TEST DIRECTED GRAPHS FOR ISOMORPHISM USING DISTANCE MATRICES
    SCHMIDT, DC
    DRUFFEL, LE
    JOURNAL OF THE ACM, 1976, 23 (03) : 433 - 445
  • [49] A heuristic algorithm for optical character recognition of Arabic script
    Atici, AA
    YarmanVural, FT
    SIGNAL PROCESSING, 1997, 62 (01) : 87 - 99
  • [50] A heuristic algorithm for optical character recognition of Arabic script
    YarmanVural, FT
    Atici, A
    VISUAL COMMUNICATIONS AND IMAGE PROCESSING '96, 1996, 2727 : 725 - 736
12345