{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T08:52:05Z","timestamp":1780822325055,"version":"3.54.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319181721","type":"print"},{"value":"9783319181738","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18173-8_22","type":"book-chapter","created":{"date-parts":[[2015,5,15]],"date-time":"2015-05-15T08:47:43Z","timestamp":1431679663000},"page":"300-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["End-Vertices of Graph Search Algorithms"],"prefix":"10.1007","author":[{"given":"Dieter","family":"Kratsch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mathieu","family":"Liedloff","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Meister","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,5,16]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellmann","year":"1962","unstructured":"Bellmann, R.: Dynamic programming treatment of the travelling salesman problem. Journal of the ACM 9, 61\u201363 (1962)","journal-title":"Journal of the ACM"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/110839229","volume":"43","author":"A Bj\u00f6rklund","year":"2014","unstructured":"Bj\u00f6rklund, A.: Determinant Sums for Undirected Hamiltonicity. SIAM Journal on Computing 43, 280\u2013299 (2014)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0012-365X(96)00070-2","volume":"171","author":"A Brandst\u00e4dt","year":"1997","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Nicolai, F.: LexBFS-orderings and powers of chordal graphs. Discrete Mathematics 171, 27\u201342 (1997)","journal-title":"Discrete Mathematics"},{"key":"22_CR4","first-page":"57","volume":"16.2","author":"P Charbit","year":"2014","unstructured":"Charbit, P., Habib, M., Mamcarz, A.: Influence of the tie-break rule on the end-vertex problem. Discrete Mathematics and Theoretical Computer Science 16.2, 57\u201372 (2014)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"22_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.dam.2003.07.001","volume":"138","author":"DG Corneil","year":"2004","unstructured":"Corneil, D.G.: A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Applied Mathematics 138, 371\u2013379 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1137\/11083856X","volume":"42","author":"DG Corneil","year":"2013","unstructured":"Corneil, D.G., Dalton, B., Habib, M.: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs. SIAM Journal on Computing 42, 792\u2013807 (2013)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.dam.2009.10.001","volume":"158","author":"DG Corneil","year":"2010","unstructured":"Corneil, D.G., K\u00f6hler, E., Lanlignel, J.-M.: On end-vertices of lexicographic breadth first searches. Discrete Applied Mathematics 158, 434\u2013443 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/050623498","volume":"22","author":"DG Corneil","year":"2008","unstructured":"Corneil, D.G., Krueger, R.: A Unified View of Graph Searching. SIAM Journal on Discrete Mathematics 22, 1259\u20131276 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Kratsch, D.: Exact exponential algorithms. Springer (2010)","DOI":"10.1007\/978-3-642-16533-7"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics 10, 196\u2013210 (1962)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM Jounal on Computing 5, 266\u2013283 (1976)","journal-title":"SIAM Jounal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18173-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:58:50Z","timestamp":1676941130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18173-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181721","9783319181738"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18173-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}