{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:20Z","timestamp":1725544040893},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114397"},{"type":"electronic","value":"9783642114403"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11440-3_12","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T11:03:36Z","timestamp":1265108616000},"page":"125-135","source":"Crossref","is-referenced-by-count":0,"title":["Reconstruction Algorithm for Permutation Graphs"],"prefix":"10.1007","author":[{"given":"Masashi","family":"Kiyomi","sequence":"first","affiliation":[]},{"given":"Toshiki","family":"Saitoh","sequence":"additional","affiliation":[]},{"given":"Ryuhei","family":"Uehara","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H. Bandelt","year":"1986","unstructured":"Bandelt, H., Mulder, H.M.: Distance-hereditary graphs. Journal of Combinatorial Theory, Series B\u00a041, 182\u2013208 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/jgt.3190140102","volume":"14","author":"B. Bollob\u00e1s","year":"1990","unstructured":"Bollob\u00e1s, B.: Almost every graph has reconstruction number three. Journal of Graph Theory\u00a014, 1\u20134 (1990)","journal-title":"Journal of Graph Theory"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bondy, J.A.: A graph reconstructor\u2019s manual. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0166, pp. 221\u2013252 (1991)","DOI":"10.1017\/CBO9780511666216.009"},{"key":"12_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Spinrad, J.P.: Graph classes: a survey. SIAM, Philadelphia (1999)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E. Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms\u00a041, 360\u2013387 (2001)","journal-title":"Journal of Algorithms"},{"key":"12_CR6","volume-title":"Algorithmic Combinatorics","author":"S. Even","year":"1973","unstructured":"Even, S.: Algorithmic Combinatorics. Macmillan, New York (1973)"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare graphen. Acta Mathematica Hungarica\u00a018, 25\u201366 (1967)","journal-title":"Acta Mathematica Hungarica"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01838185","volume":"9","author":"D.L. Greenwell","year":"1973","unstructured":"Greenwell, D.L., Hemminger, R.L.: Reconstructing the n-connected components of a graph. Aequationes Mathematicae\u00a09, 19\u201322 (1973)","journal-title":"Aequationes Mathematicae"},{"key":"12_CR9","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/BFb0066431","volume-title":"Graphs and Combinatorics","author":"F. Harary","year":"1974","unstructured":"Harary, F.: A survey of the reconstruction conjecture. In: Graphs and Combinatorics. Lecture Notes in Mathematics, vol.\u00a0406, pp. 18\u201328. Springer, Heidelberg (1974)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.dam.2006.04.038","volume":"152","author":"E. Hemaspaandra","year":"2007","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Radziszowski, S., Tripathi, R.: Complexity results in graph reconstruction. Discrete Applied Mathematics\u00a0152, 103\u2013118 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"P.J. Kelly","year":"1957","unstructured":"Kelly, P.J.: A congruence theorem for trees. Pacific Journal of Mathematics\u00a07, 961\u2013968 (1957)","journal-title":"Pacific Journal of Mathematics"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/978-3-642-02882-3_12","volume-title":"COCOON 2009","author":"M. Kiyomi","year":"2009","unstructured":"Kiyomi, M., Saitoh, T., Uehara, R.: Reconstruction of interval graphs. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 106\u2013115. Springer, Heidelberg (2009)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01578845","volume":"27","author":"D. Kratsch","year":"1994","unstructured":"Kratsch, D., Hemaspaandra, L.A.: On the complexity of graph reconstruction. Mathematical Systems Theory\u00a027, 257\u2013273 (1994)","journal-title":"Mathematical Systems Theory"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1006\/jagm.1994.1007","volume":"16","author":"T.H. Ma","year":"1994","unstructured":"Ma, T.H., Spinrad, J.P.: An $\\mbox{\\cal O}(n^2)$ algorithm for undirected split decomposition. Journal on Algorithms\u00a016, 145\u2013160 (1994)","journal-title":"Journal on Algorithms"},{"key":"12_CR15","first-page":"123","volume":"15","author":"B.D. McKay","year":"1997","unstructured":"McKay, B.D.: Small graphs are reconstructible. Australasian Journal of Combinatorics\u00a015, 123\u2013126 (1997)","journal-title":"Australasian Journal of Combinatorics"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(93)90516-V","volume":"113","author":"J.H. Schmerl","year":"1993","unstructured":"Schmerl, J.H., Trotter, W.T.: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discrete Mathematics\u00a0113, 191\u2013205 (1993)","journal-title":"Discrete Mathematics"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1007\/BFb0036947","volume-title":"Automata, Languages and Programming","author":"J. Spinrad","year":"1983","unstructured":"Spinrad, J., Valdes, J.: Recognition and isomorphism of two-dimensional partial orders. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 676\u2013686. Springer, Heidelberg (1983)"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations. AMS (2003)","DOI":"10.1090\/fim\/019"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/S0021-9800(67)80032-2","volume":"2","author":"W.T. Tutte","year":"1967","unstructured":"Tutte, W.T.: On dichromatic polynomials. Journal of Combinatorial Theory\u00a02, 310\u2013320 (1967)","journal-title":"Journal of Combinatorial Theory"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0012-365X(83)90099-7","volume":"47","author":"M. Rimscha von","year":"1983","unstructured":"von Rimscha, M.: Reconstructibility and perfect graphs. Discrete Mathematics\u00a047, 283\u2013291 (1983)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11440-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:40:30Z","timestamp":1606167630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11440-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114397","9783642114403"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11440-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}