{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:05:57Z","timestamp":1648595157022},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,17]],"date-time":"2007-10-17T00:00:00Z","timestamp":1192579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1007\/s00224-007-9077-7","type":"journal-article","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:50:55Z","timestamp":1192546255000},"page":"356-368","source":"Crossref","is-referenced-by-count":2,"title":["Computing Graph Automorphism from Partial Solutions"],"prefix":"10.1007","volume":"44","author":[{"given":"Takayuki","family":"Nagoya","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,17]]},"reference":[{"key":"9077_CR1","first-page":"34","volume-title":"Proceedings of the 14th Annual IEEE Conference on Computational Complexity","author":"A. G\u00e1l","year":"1999","unstructured":"G\u00e1l, A., Halevi, S., Lipton, R., Petrank, E.: Computing from partial solutions. In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pp. 34\u201345. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"9077_CR2","first-page":"339","volume-title":"Proceedings of the Seventh Italian Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2202","author":"A. Gro\u00dfe","year":"2001","unstructured":"Gro\u00dfe, A., Rothe, J., Wechsung, G.: Relating partial and complete solutions and the complexity of computing smallest solutions. In: Proceedings of the Seventh Italian Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 2202, pp. 339\u2013356. Springer, Berlin (2001)"},{"key":"9077_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00224-001-1048-9","volume":"35","author":"A. Gro\u00dfe","year":"2002","unstructured":"Gro\u00dfe, A., Rothe, J., Wechsung, G.: Computing complete graph isomorphisms and Hamiltonian cycles from partial ones. Theory Comput. Syst. 35, 81\u201393 (2002)","journal-title":"Theory Comput. Syst."},{"key":"9077_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"J. K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkh\u00e4user, Basel (1993)"},{"key":"9077_CR5","doi-asserted-by":"crossref","unstructured":"Lozano, A., Tor\u00e1n, J.: On the nonuniform complexity of the graph isomorphism problem. In: Proceedings of the 7th Structure in Complexity Theory Conference, pp. 118\u2013129, 1992","DOI":"10.1109\/SCT.1992.215387"},{"key":"9077_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/0210002","volume":"10","author":"A. Lubiw","year":"1981","unstructured":"Lubiw, A.: Some NP-complete problems similar to graph isomorphism. SIAM J. Comput. 10, 11\u201321 (1981)","journal-title":"SIAM J. Comput."},{"key":"9077_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","volume":"1","author":"R.C. Read","year":"1977","unstructured":"Read, R.C., Corneil, D.G.: The graph isomorphism disease. J. Graph Theory 1, 339\u2013363 (1977)","journal-title":"J. Graph Theory"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9077-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9077-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9077-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:35Z","timestamp":1558698695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9077-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,17]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9077"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9077-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,17]]}}}