{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:44Z","timestamp":1725488504732},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_44","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"529-541","source":"Crossref","is-referenced-by-count":3,"title":["Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Lanlignel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Raynaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Thierry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"44_CR1","unstructured":"A. V. Aho, I. E. Hopcroft, and J. D. Ullman. The design and analysis of computer algorithms. Addison-Welsey, 1974, exercise 2.12 on page 71."},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H. J. Bandelt","year":"1986","unstructured":"H. J. Bandelt and H. M. Mulder. Distance-hereditary graphs. J. Combin. Theory, Ser. B, 41:182\u2013208, 1986.","journal-title":"J. Combin. Theory"},{"key":"44_CR3","unstructured":"G. Damiand. Quelques propri\u00e9t\u00e9s des graphes distances h\u00e9r\u00e9ditaires. Master\u2019s thesis, Universit\u00e9 de Montpellier II, LIRMM, 1997."},{"key":"44_CR4","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. Freeman, 1979."},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"P. Hammer","year":"1990","unstructured":"P. Hammer and F. Maffray. Completely separable graphs. Discrete Applied Mathematics, 27:85\u201399, 1990.","journal-title":"Discrete Applied Mathematics"},{"key":"44_CR6","unstructured":"M. Habib, R. McConnell, C. Paul, and L. Viennot. LexBFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theor. Comp. Sci., 1999. to appear."},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E. Howorka","year":"1977","unstructured":"E. Howorka. A characterization of distance-hereditary graphs. Quart. J. Math. Oxford, Ser. 2, 28:417\u2013420, 1977.","journal-title":"Quart. J. Math. Oxford"},{"key":"44_CR8","unstructured":"D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, 1973."},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(94)00350-R","volume":"149","author":"H. M\u00fcller","year":"1996","unstructured":"H. M\u00fcller. On edge perfectness and classes of bipartite graphs. Discrete Mathematics, 149:159\u2013187, 1996.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"44_CR10","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"D. J. Rose, R. E. Tarjan, and G. S. Leuker. Algorithmic aspects of vertex elimination on graphs. SIAM J. of Computing, 5(2):266\u2013283, June 1976.","journal-title":"SIAM J. of Computing"},{"key":"44_CR11","unstructured":"A more detailed version of this article \n                  http:\/\/www.lirmm.fr\/~thierry"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T22:23:36Z","timestamp":1550442216000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_44","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}