{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:56:06Z","timestamp":1725573366551},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_21","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"196-205","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of the G-Reconstruction Problem"],"prefix":"10.1007","author":[{"given":"Zden\u011bk","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[]},{"given":"V\u00edt","family":"Jel\u00ednek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","volume-title":"A Collection of Mathematical Problems","author":"S.M. Ulam","year":"1960","unstructured":"Ulam, S.M.: A Collection of Mathematical Problems. Wiley, New York (1960)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/jgt.3190010306","volume":"1","author":"J.A. Bondy","year":"1977","unstructured":"Bondy, J.A., Hemminger, R.L.: Graph Reconstruction \u2013 a survey. J. Graph Theory\u00a01, 227\u2013268 (1977)","journal-title":"J. Graph Theory"},{"key":"21_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/0209047","volume":"9","author":"L. Babai","year":"1980","unstructured":"Babai, L., Erdos, P., Selkow, S.M.: Random graph isomorphism. SIAM J. Computing\u00a09, 628\u2013635 (1980)","journal-title":"SIAM J. Computing"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0095-8956(85)90051-6","volume":"39","author":"V. Chv\u00e1tal","year":"1985","unstructured":"Chv\u00e1tal, V., Ho\u00e0ng, C.T.: On the P\n                           4-structure of perfect graphs I. Even decompositions. J. Combin. Theory Ser. B\u00a039, 209\u2013219 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0095-8956(85)90052-8","volume":"39","author":"C.T. Ho\u00e0ng","year":"1985","unstructured":"Ho\u00e0ng, C.T.: On the P\n                           4-structure of perfect graphs II. Odd decompositions. J. Combin. Theory Ser. B\u00a039, 220\u2013232 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0095-8956(87)90022-0","volume":"43","author":"B.A. Reed","year":"1987","unstructured":"Reed, B.A.: A semi-strong perfect graph theorem. J. Combin. Theory B\u00a043, 223\u2013240 (1987)","journal-title":"J. Combin. Theory B"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0095-8956(87)90010-4","volume":"43","author":"V. Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V.: On the P\n                           4-structure of perfect graphs III. Partner decompositions. J. Combin. Theory Ser. B\u00a043, 349\u2013353 (1987)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/jctb.1996.0018","volume":"66","author":"R. Hayward","year":"1996","unstructured":"Hayward, R.: Recognizing P\n                           3-structure: A Switching Approach. Journal Comb. Theory (Series B)\u00a066(2), 247\u2013262 (1996)","journal-title":"Journal Comb. Theory (Series B)"},{"key":"21_CR10","unstructured":"Hayward, R., Hougardy, S., Reed, B.: Polynomial time recognition of P\n                           4-structure. In: Proceedings of 13th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 382\u2013389 (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:41Z","timestamp":1619506961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11602613_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}