Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones

  title={Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones},
  author={A. Gro{\ss}e and J. Rothe and G. Wechsung},
  journal={Theory of Computing Systems},
  • A. Große, J. Rothe, G. Wechsung
  • Published 2001
  • Computer Science, Mathematics
  • Theory of Computing Systems
  • Abstract. We prove that computing a single pair of vertices that are mapped onto each other by an isomorphism φ between two isomorphic graphs is as hard as computing φ itself. This result optimally improves upon a result of Gál, Halevi, Lipton, and Petrank. We establish a similar, albeit slightly weaker, result about computing complete Hamiltonian cycles of a graph from partial Hamiltonian cycles. 

    Figures and Topics from this paper.

    Computing Graph Automorphism from Partial Solutions
    • 2
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
    • 15
    • PDF
    Relating Complete and Partial Solution for Problems Similar to Graph Automorphism
    • 1
    CS-2008-08 Reductions of Graph Isomorphism Problems


    Publications referenced by this paper.
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 45,335
    • PDF
    Graph Isomorphism is in the Low Hierarchy
    • 153
    Optimal Algorithms for Self-Reducible Problems
    • 110
    • PDF
    On self-transformable combinatorial problems
    • 23
    Natural Self-Reducible Sets
    • 45
    On Self-Reducibility and Weak P-Selectivity
    • K. Ko
    • Mathematics, Computer Science
    • 1983
    • 157
    • PDF
    Computing from partial solutions
    • 31