Reductions to Graph Isomorphism

被引：3
|
作者：
Toran, Jacobo [1 ]
机构：
[1] Univ Ulm, Inst Theoret Informat, D-89069 Ulm, Germany
来源：
THEORY OF COMPUTING SYSTEMS | 2010年 / 47卷 / 01期
关键词：
Computational complexity; Reducibilities; Graph isomorphism;
D O I：
10.1007/s00224-008-9159-1
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that several reducibility notions coincide when applied to the Graph Isomorphism (GI) problem. In particular we show that if a set is many-one logspace reducible to GI, then it is in fact many-one AC(0) reducible to GI. For the case of Turing reducibilities we show that for any k >= 0 an NCk+1 reduction to GI can be transformed into an AC(k) reduction to the same problem.
引用
收藏
页码：288 / 299
页数：12
相关论文
共 50 条
  • [1] Reductions to graph isomorphism
    Toran, Jacobo
    [J]. FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 158 - 167
  • [2] Reductions to Graph Isomorphism
    Jacobo Torán
    [J]. Theory of Computing Systems, 2010, 47 : 288 - 299
  • [3] Isomorphism of the graph
    Wu, Huaan
    [J]. DCABES 2007 Proceedings, Vols I and II, 2007, : 1104 - 1106
  • [4] ON GRAPH ISOMORPHISM AND GRAPH AUTOMORPHISM
    ZIVKOVIC, TP
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1991, 8 (1-3) : 19 - 37
  • [5] RANDOM GRAPH ISOMORPHISM
    BABAI, L
    ERDOS, P
    SELKOW, SM
    [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 628 - 635
  • [6] On graph isomorphism for restricted graph classes
    Koebler, Johannes
    [J]. LOGICAL APPROACHES TO COMPUTATIONAL BARRIERS, PROCEEDINGS, 2006, 3988 : 241 - 256
  • [7] Graph fibrations, graph isomorphism, and pagerank
    Boldi, Paolo
    Lonati, Violetta
    Santini, Massimo
    Vigna, Sebastiano
    [J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2006, 40 (02): : 227 - 253
  • [8] On Soft Graph Isomorphism
    Thumbakara, Rajesh K.
    Jose, Jinta
    George, Bobin
    [J]. NEW MATHEMATICS AND NATURAL COMPUTATION, 2023,
  • [9] Testing graph isomorphism
    Fischer, Eldar
    Matsliah, Arie
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 207 - 225
  • [10] On the hardness of graph isomorphism
    Torán, J
    [J]. 41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 180 - 186
12345