A NONFACTORIAL ALGORITHM FOR TESTING ISOMORPHISM OF 2 GRAPHS

被引：6
|
作者：
GOLDBERG, MK
机构：
来源：
DISCRETE APPLIED MATHEMATICS | 1983年 / 6卷 / 03期
关键词：
D O I：
10.1016/0166-218X(83)90078-1
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：229 / 236
页数：8
相关论文
共 50 条
  • [31] The complexity of testing all properties of planar graphs, and the role of isomorphism
    Basu, Sabyasachi
    Kumar, Akash
    Seshadhri, C.
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 1702 - 1714
  • [32] Testing isomorphism of circular-arc graphs in polynomial time
    Nedela, Roman
    Ponomarenko, Ilia
    Zeman, Peter
    arXiv, 2019,
  • [33] OPTIMAL PARALLEL ALGORITHMS FOR TESTING ISOMORPHISM OF TREES AND OUTERPLANAR GRAPHS
    LEVCOPOULOS, C
    LINGAS, A
    PETERSSON, O
    RYTTER, W
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 472 : 204 - 214
  • [34] Computational complexity of reconstruction and isomorphism testing for designs and line graphs
    Huber, Michael
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2011, 118 (02) : 341 - 349
  • [35] 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
  • [36] A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs
    McCreesh, Ciaran
    Prosser, Patrick
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2015, 2015, 9255 : 295 - 312
  • [37] PRINCIPLE OF AN ALGORITHM FROM RESEARCH ON ISOMORPHISM BETWEEN TWO GRAPHS
    STEEN, JP
    REVUE FRANCAISE D INFORMATIQUE DE RECHERCHE OPERATIONNELLE, 1969, 3 (NR3): : 51 - &
  • [38] A LINEAR-TIME ALGORITHM FOR ISOMORPHISM OF A SUBCLASS OF CHORDAL GRAPHS
    VEERARAGHAVULU, NC
    KUMAR, PS
    MADHAVAN, CEV
    INFORMATION PROCESSING LETTERS, 1992, 44 (01) : 45 - 49
  • [39] WHITNEYS 2-ISOMORPHISM THEOREM FOR GRAPHS
    TRUEMPER, K
    JOURNAL OF GRAPH THEORY, 1980, 4 (01) : 43 - 49
  • [40] GIT - A HEURISTIC PROGRAM FOR TESTING PAIRS OF DIRECTED LINE GRAPHS FOR ISOMORPHISM
    UNGER, SH
    COMMUNICATIONS OF THE ACM, 1964, 7 (01) : 26 - 34
12345