Computing complete graph isomorphisms and Hamiltonian cycles from partial ones

Theory of Computing Systems

Volumn 35, Issue 1, 2002, Pages 81-93

  Gross e A ^a   Rothe, J ^b   Wechsung, G ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONFORMAL MAPPING; GRAPH THEORY; HAMILTONIANS; SET THEORY;

GRAPH ISOMORPHISMS;

COMPUTER SCIENCE;

EID: 18344400032     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-001-1048-9     Document Type: Article

References (14)

1. [GHLP] A. Gál, S. Halevi, R. Lipton, and E. Petrank. Computing from partial solutions. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pages 34-45. IEEE Computer Society Press, Los Alamitos, CA, May 1999.
2. [GJ] M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
3. [GRW] A. Große, J. Rothe, and G. Wechsung. Relating partial and complete solutions and the complexity of computing smallest solutions. In Proceedings of the Seventh Italian Conference on Theoretical Computer Science, pages 339-356. Lecture Notes in Computer Science #2202, Springer-Verlag, Berlin, October 2001.
4. [HNOS] E. Hemaspaandra, A. Naik, M. Ogihara, and A. Selman. P-selective sets and reducing search to decision vs. self-reducibility. Journal of Computer and System Sciences, 53(2): 194-209, 1996.
5. [JY] D. Joseph and P. Young. Self-reducibility: effects of internal structure on computational complexity. In A. Selman, editor, Complexity Theory Retrospective, pages 82-107. Springer-Verlag, New York, 1990.
6. [Ka] R. Karp. Reducibilities among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85-103, 1972.
7. [Ko] K. Ko. On self-reducibility and weak P-selectivity. Journal of Computer and System Sciences, 26(2):209-221, 1983.
8. [KST1] J. Köbler, U. Schöning, and J. Torán. Graph isomorphism is low for PP. Computational Complexity, 2:301-330, 1992.
9. [KST2] J. Köbler, U. Schöning, and J. Torán. The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser, Basel, 1993.
10. [MP] A. Meyer and M. Paterson. With what frequency are apparently intractable problems difficult? Technical Report MIT/LCS/TM-126, MIT Laboratory for Computer Science, Cambridge, MA, 1979.
11. [Sc1] C. Schnorr. Optimal algorithms for self-reducible problems. In S. Michaelson and R. Milner, editors, Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming, pages 322-337, University of Edinburgh, July 1976. Edinburgh University Press, Edinburgh.
12. [Sc2] C. Schnorr. On self-transformable combinatorial problems, 1979. Presented at IEEE Symposium on Information Theory, Udine, and Symposium über Mathematische Optimierung, Oberwolfach.
13. [Sc3] U. Schöning. Graph isomorphism is in the low hierarchy. Journal of Computer and System Sciences, 37:312-323, 1987.
14. [Se] A. Selman. Natural self-reducible sets. SIAM Journal on Computing, 17(5):989-996, 1988.