{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:12:28Z","timestamp":1742919148038,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031159138"},{"type":"electronic","value":"9783031159145"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15914-5_31","type":"book-chapter","created":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:14:22Z","timestamp":1664536462000},"page":"425-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Linearizing Partial Search Orders"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6007-4202","authenticated-orcid":false,"given":"Robert","family":"Scheffler","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,1]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","unstructured":"Beisegel, J., et al.: Recognizing graph search trees. Preprint on arXiv (2018). https:\/\/doi.org\/10.48550\/arXiv.1811.09249","DOI":"10.48550\/arXiv.1811.09249"},{"key":"31_CR2","doi-asserted-by":"publisher","unstructured":"Beisegel, J., et al.: On the End-Vertex Problem of Graph Searches. Discrete Math. Theor. Comput. Sci. 21(1) (2019). https:\/\/doi.org\/10.23638\/DMTCS-21-1-13","DOI":"10.23638\/DMTCS-21-1-13"},{"key":"31_CR3","doi-asserted-by":"publisher","unstructured":"Beisegel, J., et al.: Recognizing graph search trees. In: Proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium. ENTCS, vol. 346, pp. 99\u2013110. Elsevier (2019). https:\/\/doi.org\/10.1016\/j.entcs.2019.08.010","DOI":"10.1016\/j.entcs.2019.08.010"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1137\/20M1313301","volume":"35","author":"J Beisegel","year":"2021","unstructured":"Beisegel, J., et al.: The recognition problem of graph search trees. SIAM J. Discrete Math. 35(2), 1418\u20131446 (2021). https:\/\/doi.org\/10.1137\/20M1313301","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"31_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00453-004-1084-3","volume":"39","author":"A Berry","year":"2004","unstructured":"Berry, A., Blair, J.R., Heggernes, P., Peyton, B.W.: Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica 39(4), 287\u2013298 (2004). https:\/\/doi.org\/10.1007\/s00453-004-1084-3","journal-title":"Algorithmica"},{"issue":"4","key":"31_CR6","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.1137\/060664690","volume":"22","author":"A Bretscher","year":"2008","unstructured":"Bretscher, A., Corneil, D., Habib, M., Paul, C.: A simple linear time LexBFS cograph recognition algorithm. SIAM J. Discrete Math. 22(4), 1277\u20131296 (2008). https:\/\/doi.org\/10.1137\/060664690","journal-title":"SIAM J. Discrete Math."},{"key":"31_CR7","doi-asserted-by":"publisher","unstructured":"Charbit, P., Habib, M., Mamcarz, A.: Influence of the tie-break rule on the end-vertex problem. Discrete Math. Theor. Comput. Sci. 16(2), 57 (2014). https:\/\/doi.org\/10.46298\/dmtcs.2081","DOI":"10.46298\/dmtcs.2081"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ipl.2007.12.009","volume":"107","author":"FPM Chu","year":"2008","unstructured":"Chu, F.P.M.: A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements. Inf. Process. Lett. 107(1), 7\u201312 (2008). https:\/\/doi.org\/10.1016\/j.ipl.2007.12.009","journal-title":"Inf. Process. Lett."},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.dam.2015.06.011","volume":"199","author":"DG Corneil","year":"2016","unstructured":"Corneil, D.G., Dusart, J., Habib, M., Mamcarz, A., De Montgolfier, F.: A tie-break model for graph search. Discrete Appl. Math. 199, 89\u2013100 (2016). https:\/\/doi.org\/10.1016\/j.dam.2015.06.011","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"31_CR10","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 Appl. Math. 158(5), 434\u2013443 (2010). https:\/\/doi.org\/10.1016\/j.dam.2009.10.001","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"31_CR11","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/050623498","volume":"22","author":"DG Corneil","year":"2008","unstructured":"Corneil, D.G., Krueger, R.M.: A unified view of graph searching. SIAM J. Discrete Math. 22(4), 1259\u20131276 (2008). https:\/\/doi.org\/10.1137\/050623498","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"31_CR12","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1137\/S0895480100373455","volume":"23","author":"DG Corneil","year":"2009","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. SIAM J. Discrete Math. 23(4), 1905\u20131953 (2009). https:\/\/doi.org\/10.1137\/S0895480100373455","journal-title":"SIAM J. Discrete Math."},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.dam.2015.07.016","volume":"216","author":"J Dusart","year":"2017","unstructured":"Dusart, J., Habib, M.: A new LBFS-based algorithm for cocomparability graph recognition. Discrete Appl. Math. 216, 149\u2013161 (2017). https:\/\/doi.org\/10.1016\/j.dam.2015.07.016","journal-title":"Discrete Appl. Math."},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.dam.2017.02.027","volume":"225","author":"J Gorzny","year":"2017","unstructured":"Gorzny, J., Huang, J.: End-vertices of LBFS of (AT-free) bigraphs. Discrete Appl. Math. 225, 87\u201394 (2017). https:\/\/doi.org\/10.1016\/j.dam.2017.02.027","journal-title":"Discrete Appl. Math."},{"key":"31_CR15","doi-asserted-by":"publisher","unstructured":"Hagerup, T.: Biconnected graph assembly and recognition of DFS trees. Technical report A 85\/03, Universit\u00e4t des Saarlandes (1985). https:\/\/doi.org\/10.22028\/D291-26437","DOI":"10.22028\/D291-26437"},{"key":"31_CR16","unstructured":"Hagerup, T., Nowak, M.: Recognition of spanning trees defined by graph searches. Technical report A 85\/08, Universit\u00e4t des Saarlandes (1985)"},{"issue":"4","key":"31_CR17","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. J. ACM 21(4), 549\u2013568 (1974). https:\/\/doi.org\/10.1145\/321850.321852","journal-title":"J. ACM"},{"issue":"2\u20133","key":"31_CR18","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.dam.2010.02.011","volume":"159","author":"R Krueger","year":"2011","unstructured":"Krueger, R., Simonet, G., Berry, A.: A general label search to investigate classical graph search algorithms. Discrete Appl. Math. 159(2\u20133), 128\u2013142 (2011). https:\/\/doi.org\/10.1016\/j.dam.2010.02.011","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"31_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(98)00123-1","volume":"89","author":"PS Kumar","year":"1998","unstructured":"Kumar, P.S., Madhavan, C.E.V.: Minimal vertex separators of chordal graphs. Discrete Appl. Math. 89(1), 155\u2013168 (1998). https:\/\/doi.org\/10.1016\/S0166-218X(98)00123-1","journal-title":"Discrete Appl. Math."},{"key":"31_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-022-00981-5","author":"G Rong","year":"2022","unstructured":"Rong, G., Cao, Y., Wang, J., Wang, Z.: Graph searches and their end vertices. Algorithmica (2022). https:\/\/doi.org\/10.1007\/s00453-022-00981-5","journal-title":"Algorithmica"},{"issue":"2","key":"31_CR21","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 J. Comput. 5(2), 266\u2013283 (1976). https:\/\/doi.org\/10.1137\/0205021","journal-title":"SIAM J. Comput."},{"key":"31_CR22","doi-asserted-by":"publisher","unstructured":"Scheffler, R.: Linearizing partial search orders. Preprint on arXiv (2022). https:\/\/doi.org\/10.48550\/arXiv.2206.14556","DOI":"10.48550\/arXiv.2206.14556"},{"issue":"3","key":"31_CR23","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13(3), 566\u2013579 (1984). https:\/\/doi.org\/10.1137\/0213035","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15914-5_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T11:19:20Z","timestamp":1664536760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15914-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031159138","9783031159145"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15914-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcbingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"48","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.inf.uni-tuebingen.de\/wg2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"96","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}