{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:18:24Z","timestamp":1778296704132,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228233","type":"print"},{"value":"9783540286295","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28629-5_20","type":"book-chapter","created":{"date-parts":[[2010,12,17]],"date-time":"2010-12-17T17:59:50Z","timestamp":1292608790000},"page":"287-297","source":"Crossref","is-referenced-by-count":2,"title":["Complexity Results in Graph Reconstruction"],"prefix":"10.1007","author":[{"given":"Edith","family":"Hemaspaandra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lane A.","family":"Hemaspaandra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanis\u0142aw","family":"Radziszowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rahul","family":"Tripathi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/jgt.3190010306","volume":"1","author":"J. Bondy","year":"1977","unstructured":"Bondy, J., Hemminger, R.: Graph reconstruction\u2014a survey. Journal of Graph Theory\u00a01, 227\u2013268 (1977)","journal-title":"Journal of Graph Theory"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2140\/pjm.1969.31.281","volume":"31","author":"J. Bondy","year":"1969","unstructured":"Bondy, J.: On Ulam\u2019s conjecture for separable graphs. Pacific Journal of Mathematics\u00a031, 281\u2013288 (1969)","journal-title":"Pacific Journal of Mathematics"},{"key":"20_CR3","series-title":"London Mathematical Society Lecture Notes Series 66","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BFb0085120","volume-title":"Surveys in Combinatorics","author":"J. Bondy","year":"1991","unstructured":"Bondy, J.: A graph reconstructor\u2019s manual. In: Surveys in Combinatorics. London Mathematical Society Lecture Notes Series 66, pp. 221\u2013252. Cambridge University Press, Cambridge (1991)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0095-8956(71)90024-4","volume":"11","author":"R. Bryant","year":"1971","unstructured":"Bryant, R.: On a conjecture concerning the reconstruction of graphs. Journal of Combinatorial Theory\u00a011, 139\u2013141 (1971)","journal-title":"Journal of Combinatorial Theory"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/0148063","volume":"48","author":"H. Carrillo","year":"1988","unstructured":"Carrillo, H., Lipman, D.: The multiple sequence alignment problem in biology. SIAM Journal of Applied Mathematics\u00a048, 1073\u20131082 (1988)","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"1","key":"20_CR6","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/S0022-0000(05)80024-8","volume":"48","author":"S. Fenner","year":"1994","unstructured":"Fenner, S., Fortnow, L., Kurtz, S.: Gap-definable counting classes. Journal of Computer and System Sciences\u00a048(1), 116\u2013148 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR7","first-page":"47","volume-title":"Theory of Graphs and its Applications","author":"F. Harary","year":"1964","unstructured":"Harary, F.: On the reconstruction of a graph from a collection of subgraphs. In: Fiedler, M. (ed.) Theory of Graphs and its Applications, pp. 47\u201352. Czechoslovak Academy of Sciences, Prague (1964)"},{"key":"20_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04880-1","volume-title":"The Complexity Theory Companion","author":"L. Hemaspaandra","year":"2002","unstructured":"Hemaspaandra, L., Ogihara, M.: The Complexity Theory Companion. Springer, Heidelberg (2002)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"803","DOI":"10.4153\/CJM-1966-079-8","volume":"18","author":"F. Harary","year":"1966","unstructured":"Harary, F., Palmer, E.: The reconstruction of a tree from its maximal subtrees. Canadian Journal of Mathematics\u00a018, 803\u2013810 (1966)","journal-title":"Canadian Journal of Mathematics"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1002\/jgt.3190090403","volume":"9","author":"F. Harary","year":"1985","unstructured":"Harary, F., Plantholt, M.: The graph reconstruction number. J. Graph Theory\u00a09, 451\u2013454 (1985)","journal-title":"J. Graph Theory"},{"key":"20_CR11","unstructured":"Kadin, J.: Restricted Turing Reducibilities and the Structure of the Polynomial Time Hierarchy. PhD thesis, Cornell University, USA (1988)"},{"key":"20_CR12","unstructured":"Kelly, P.: On Isometric Transformations. PhD thesis, University of Wisconsin, USA (1942)"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"P. Kelly","year":"1957","unstructured":"Kelly, P.: A congruence theorem for trees. Pacific Journal of Mathematics\u00a07, 961\u2013968 (1957)","journal-title":"Pacific Journal of Mathematics"},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01578845","volume":"27","author":"D. Kratsch","year":"1994","unstructured":"Kratsch, D., Hemaspaandra, L.: On the complexity of graph reconstruction. Mathematical Systems Theory\u00a027(3), 257\u2013273 (1994)","journal-title":"Mathematical Systems Theory"},{"key":"20_CR15","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":"20_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0012-365X(83)90023-7","volume":"43","author":"J. Lauri","year":"1983","unstructured":"Lauri, J.: Proof of Harary\u2019s conjecture on the reconstruction of trees. Discrete Mathematics\u00a043, 79\u201390 (1983)","journal-title":"Discrete Mathematics"},{"key":"20_CR17","unstructured":"Lauri, J., Scapellato, R.: Topics in Graph Automorphism and Reconstruction. London Mathematical Society, Cambridge University Press (2003)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1109\/SCT.1992.215387","volume-title":"Proceedings of the 7th Structure in Complexity Theory Conference","author":"A. Lozano","year":"1992","unstructured":"Lozano, A., Tor\u00e1n, J.: On the non-uniform complexity of the graph isomorphism problem. In: Proceedings of the 7th Structure in Complexity Theory Conference, June 1992, pp. 118\u2013129. IEEE Computer Society Press, Los Alamitos (1992)"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(74)90064-8","volume":"8","author":"B. Manvel","year":"1974","unstructured":"Manvel, B.: Some basic observations on Kelly\u2019s conjecture for graphs. Discrete Mathematics\u00a08, 181\u2013185 (1974)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1093\/qmath\/33.3.345","volume":"33","author":"A. Mansfield","year":"1982","unstructured":"Mansfield, A.: The relationship between the computational complexities of the legitimate deck and isomorphism problems. Quart. J. Math. Ser.\u00a033(2), 345\u2013347 (1982)","journal-title":"Quart. J. Math. Ser."},{"key":"20_CR21","first-page":"177","volume":"63","author":"B. Manvel","year":"1988","unstructured":"Manvel, B.: Reconstruction of graphs: Progress and prospects. Congressus Numerantium\u00a063, 177\u2013187 (1988)","journal-title":"Congressus Numerantium"},{"key":"20_CR22","first-page":"123","volume":"28","author":"W. Myrvold","year":"1989","unstructured":"Myrvold, W.: The ally-reconstruction number of a disconnected graph. Ars Combinat.\u00a028, 123\u2013127 (1989)","journal-title":"Ars Combinat."},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1002\/jgt.3190140203","volume":"14","author":"W. Myrvold","year":"1990","unstructured":"Myrvold, W.: The ally-reconstruction number of a tree with five or more vertices is three. Journal of Graph Theory\u00a014, 149\u2013166 (1990)","journal-title":"Journal of Graph Theory"},{"key":"20_CR24","first-page":"205","volume-title":"Selected Topics in Graph Theory","author":"C.S..J.A. Nash-Williams","year":"1978","unstructured":"Nash-Williams, C.S.J.A.: The reconstruction problem. In: Beineke, L., Wilson, R. (eds.) Selected Topics in Graph Theory, pp. 205\u2013236. Academic Press, London (1978)"},{"key":"20_CR25","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0012-365X(00)00287-9","volume":"235","author":"V. N\u00fddl","year":"2001","unstructured":"N\u00fddl, V.: Graph reconstruction from subgraphs. Discrete Mathematics\u00a0235, 335\u2013341 (2001)","journal-title":"Discrete Mathematics"},{"key":"20_CR26","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/SCT.1992.215397","volume-title":"Proceedings of the 7th Structure in Complexity Theory Conference","author":"D. Ranjan","year":"1992","unstructured":"Ranjan, D., Rohatgi, P.: On randomized reductions to sparse sets. In: Proceedings of the 7th Structure in Complexity Theory Conference, June 1992, pp. 239\u2013242. IEEE Computer Society Press, Los Alamitos (1992)"},{"key":"20_CR27","volume-title":"A Collection of Mathematical Problems","author":"S. Ulam","year":"1960","unstructured":"Ulam, S.: A Collection of Mathematical Problems. Interscience Publishers, New York (1960)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28629-5_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:54Z","timestamp":1620012474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28629-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228233","9783540286295"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28629-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}