{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T10:47:15Z","timestamp":1789469235900,"version":"build-2803163510"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T00:00:00Z","timestamp":1783123200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302060"],"award-info":[{"award-number":["62302060"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372066"],"award-info":[{"award-number":["62372066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202161"],"award-info":[{"award-number":["62202161"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ic.2026.105494","type":"journal-article","created":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T15:17:02Z","timestamp":1783351022000},"page":"105494","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Partial search orderings for MCS on chordal graphs via clique graph decomposition"],"prefix":"10.1016","volume":"312","author":[{"given":"Guozhen","family":"Rong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Biao","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7731-6818","authenticated-orcid":false,"given":"Yongjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ic.2026.105494_bib0001","series-title":"48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023","first-page":"77:1","article-title":"A polynomial-time algorithm for MCS partial search order on chordal graphs","author":"Rong","year":"2023"},{"key":"10.1016\/j.ic.2026.105494_bib0002","series-title":"9th SIAM Symposium on Simplicity in Algorithms, SOSA 2026","first-page":"298","article-title":"A linear-time algorithm for the MCS end-vertex problem on chordal graphs: a bonus-driven search strategy","author":"Rong","year":"2026"},{"issue":"4","key":"10.1016\/j.ic.2026.105494_bib0003","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1137\/050623498","article-title":"A unified view of graph searching","volume":"22","author":"Corneil","year":"2008","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"10.1016\/j.ic.2026.105494_bib0004","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.ic.2026.105494_bib0005","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.ic.2026.105494_bib0006","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/j.ic.2026.105494_bib0007","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1137\/060664690","article-title":"A simple linear time lexBFS cograph recognition algorithm","volume":"22","author":"Bretscher","year":"2008","journal-title":"SIAM J. Discret. Math."},{"issue":"3","key":"10.1016\/j.ic.2026.105494_bib0008","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/11083856X","article-title":"LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs","volume":"42","author":"Corneil","year":"2013","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.ic.2026.105494_bib0009","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1137\/20M1327835","article-title":"Corrigendum: LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs","volume":"50","author":"Dusart","year":"2021","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.ic.2026.105494_bib0010","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1137\/15M1012396","article-title":"On the power of graph searching for cocomparability graphs","volume":"30","author":"Corneil","year":"2016","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20133","key":"10.1016\/j.ic.2026.105494_bib0011","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(98)00123-1","article-title":"Minimal vertex separators of chordal graphs","volume":"89","author":"Kumar","year":"1998","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"10.1016\/j.ic.2026.105494_bib0012","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00453-004-1084-3","article-title":"Maximum cardinality search for computing minimal triangulations of graphs","volume":"39","author":"Berry","year":"2004","journal-title":"Algorithmica"},{"issue":"11","key":"10.1016\/j.ic.2026.105494_bib0013","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1016\/j.dam.2007.02.004","article-title":"On the maximum cardinality search lower bound for treewidth","volume":"155","author":"Bodlaender","year":"2007","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.ic.2026.105494_bib0014","series-title":"1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2001","first-page":"54","article-title":"Treewidth: computational experiments","author":"Koster","year":"2001"},{"issue":"1","key":"10.1016\/j.ic.2026.105494_bib0015","article-title":"On the end-vertex problem of graph searches","volume":"21","author":"Beisegel","year":"2019","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.ic.2026.105494_bib0016","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.dam.2009.10.001","article-title":"On end-vertices of lexicographic breadth first searches","volume":"158","author":"Corneil","year":"2010","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.ic.2026.105494_bib0017","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Semin. Univ. Hambg."},{"issue":"2","key":"10.1016\/j.ic.2026.105494_bib0018","first-page":"57","article-title":"Influence of the tie-break rule on the end-vertex problem","volume":"16","author":"Charbit","year":"2014","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105494_bib0019","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.dam.2017.02.027","article-title":"End-vertices of LBFS of (AT-free) bigraphs","volume":"225","author":"Gorzny","year":"2017","journal-title":"Discret. Appl. Math."},{"key":"10.1016\/j.ic.2026.105494_bib0020","series-title":"Computing and Combinatorics\u201426th International Conference, COCOON 2020","first-page":"52","article-title":"End-vertices of AT-free bigraphs","author":"Gorzny","year":"2020"},{"issue":"9","key":"10.1016\/j.ic.2026.105494_bib0021","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1007\/s00453-022-00981-5","article-title":"Graph searches and their end vertices","volume":"84","author":"Rong","year":"2022","journal-title":"Algorithmica"},{"key":"10.1016\/j.ic.2026.105494_bib0022","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2021.106176","article-title":"End vertices of graph searches on bipartite graphs","volume":"173","author":"Zou","year":"2022","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ic.2026.105494_bib0023","series-title":"Related orderings of AT-free graphs","author":"Gorzny","year":"2022"},{"key":"10.1016\/j.ic.2026.105494_bib0024","series-title":"Ready to order? On Vertex and Edge Orderings of Graphs","author":"Scheffler","year":"2023"},{"key":"10.1016\/j.ic.2026.105494_bib0025","series-title":"Tech. Rep.","article-title":"Biconnected graph assembly and recognition of DFS trees","author":"Hagerup","year":"1985"},{"key":"10.1016\/j.ic.2026.105494_bib0026","series-title":"Tech. Rep.","article-title":"Recognition of Spanning Trees Defined by Graph Searches","author":"Hagerup","year":"1985"},{"key":"10.1016\/j.ic.2026.105494_bib0027","series-title":"Graph-Theoretic Concepts in Computer Science\u201414th International Workshop, WG 1988","first-page":"87","article-title":"Dfs tree construction: algorithms and characterizations","author":"Korach","year":"1988"},{"issue":"2","key":"10.1016\/j.ic.2026.105494_bib0028","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1137\/20M1313301","article-title":"The recognition problem of graph search trees","volume":"35","author":"Beisegel","year":"2021","journal-title":"SIAM J. Discret. Math."},{"key":"10.1016\/j.ic.2026.105494_bib0029","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.tcs.2022.09.018","article-title":"On the recognition of search trees generated by BFS and DFS","volume":"936","author":"Scheffler","year":"2022","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2026.105494_bib0030","series-title":"Graph-Theoretic Concepts in Computer Science\u201448th International Workshop, WG 2022","first-page":"425","article-title":"Linearizing partial search orders","author":"Scheffler","year":"2022"},{"key":"10.1016\/j.ic.2026.105494_bib0031","series-title":"Introduction to Graph Theory","volume":"2","author":"West","year":"2001"},{"key":"10.1016\/j.ic.2026.105494_bib0032","series-title":"Graph Theory and Sparse Matrix Computation","first-page":"1","article-title":"An introduction to chordal graphs and clique trees","author":"Blair","year":"1993"},{"issue":"3","key":"10.1016\/j.ic.2026.105494_bib0033","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterisation of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discret. Math."},{"issue":"1","key":"10.1016\/j.ic.2026.105494_bib0034","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Comb. Theory Ser.-B"},{"key":"10.1016\/j.ic.2026.105494_bib0035","series-title":"Representations of rigid cycle graphs","author":"Walter","year":"1972"},{"key":"10.1016\/j.ic.2026.105494_bib0036","series-title":"Graph-Theoretic Concepts in Computer Science\u201421st International Workshop, WG 1995","first-page":"358","article-title":"Chordal graphs and their clique graphs","author":"Galinier","year":"1995"},{"issue":"5","key":"10.1016\/j.ic.2026.105494_bib0037","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.ejc.2011.09.031","article-title":"Reduced clique graphs of chordal graphs","volume":"33","author":"Habib","year":"2012","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.ic.2026.105494_bib0038","series-title":"Efficient Graph Representations","volume":"19","author":"Spinrad","year":"2003"},{"key":"10.1016\/j.ic.2026.105494_bib0039","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/j.ic.2026.105494_bib0040","first-page":"57","article-title":"O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm","volume":"6","author":"Jarn\u00edk","year":"1930","journal-title":"Pr\u00e1ca Moravsk\u00e9 Pr\u00edrodov\u011bdeck\u00e9 Spole\u010dnosti"},{"issue":"6","key":"10.1016\/j.ic.2026.105494_bib0041","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"Bell Syst. Tech. J."},{"issue":"4","key":"10.1016\/j.ic.2026.105494_bib0042","article-title":"The partial search order problem","volume":"32","author":"Scheffler","year":"2025","journal-title":"Electron. J. Comb."},{"issue":"1","key":"10.1016\/j.ic.2026.105494_bib0043","doi-asserted-by":"crossref","first-page":"5:1","DOI":"10.1145\/3711844","article-title":"Computing hamiltonian paths with partial order restrictions","volume":"17","author":"Beisegel","year":"2025","journal-title":"ACM Trans. Comput. Theory"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089054012600091X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S089054012600091X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T09:57:12Z","timestamp":1789466232000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S089054012600091X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":43,"alternative-id":["S089054012600091X"],"URL":"https:\/\/doi.org\/10.1016\/j.ic.2026.105494","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Partial search orderings for MCS on chordal graphs via clique graph decomposition","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ic.2026.105494","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"105494"}}