{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:31Z","timestamp":1725488971755},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_52","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T03:29:48Z","timestamp":1187062188000},"page":"584-595","source":"Crossref","is-referenced-by-count":0,"title":["Relating Complete and Partial Solution for Problems Similar to Graph Automorphism"],"prefix":"10.1007","author":[{"given":"Takayuki","family":"Nagoya","sequence":"first","affiliation":[]},{"given":"Seinosuke","family":"Toda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1006\/inco.1996.0097","volume":"131","author":"M. Agrawal","year":"1996","unstructured":"Agrawal, M., Arvind, V.: A note on decision versus search for graph automorphism. Information and computation\u00a0131, 179\u2013189 (1996)","journal-title":"Information and computation"},{"key":"52_CR2","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., Wechung, G.: Computing complete graph isomorphisms and hamiltonian cycles from partial ones. Theory of Computing Systems\u00a035, 81\u201393 (2002)","journal-title":"Theory of Computing Systems"},{"key":"52_CR3","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, May 1999, pp. 34\u201345. IEEE Computer Society Press, Los Alamitos (1999)"},{"doi-asserted-by":"crossref","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhauser (1993)","key":"52_CR4","DOI":"10.1007\/978-1-4612-0333-9"},{"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, 1992, pp. 118\u2013129 (1992)","key":"52_CR5","DOI":"10.1109\/SCT.1992.215387"},{"key":"52_CR6","doi-asserted-by":"publisher","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 Journal on Computing\u00a010, 11\u201321 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"52_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(79)90004-8","volume":"8","author":"R. Mathon","year":"1979","unstructured":"Mathon, R.: A note on the graph isomorphism counting problem. Information Processing Letters\u00a08(3), 131\u2013132 (1979)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Nagoya, T.: Computing graph automorphism from partial solutions. Theory of Computing Systems (to appear)","key":"52_CR8","DOI":"10.1007\/s00224-007-9077-7"},{"key":"52_CR9","doi-asserted-by":"publisher","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. Journal of Graph Theory\u00a01, 339\u2013363 (1977)","journal-title":"Journal of Graph Theory"},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1137\/S009753970241096X","volume":"33","author":"J. Toran","year":"2004","unstructured":"Toran, J.: On the hardness of graph isomorphism. SIAM Journal on Computing\u00a033, 1093\u20131108 (2004)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:29:21Z","timestamp":1619504961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}