Partial search orderings for MCS on chordal graphs via clique graph decomposition

2026/07/06 by Guozhen Rong, Biao Yuan, Wenjun Li +2

paper · doi:10.1016/j.ic.2026.105494

published in Information and Computation 312, 105494 (Elsevier BV)

crossref created 2026/07/06 · crossref deposited 2026/08/05 · crossref indexed 2026/08/05 · crossref issued 2026/09/01 · crossref published 2026/09/01 · crossref published-print 2026/09/01

Citations

• A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs
• Graph Searches and Their End Vertices
• End-vertices of LBFS of (AT-free) bigraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Depth-First Search and Linear Graph Algorithms
• On rigid circuit graphs
• A Note on Two Problems in Connexion with Graphs
• Shortest Connection Networks And Some Generalizations
• An Introduction to Chordal Graphs and Clique Trees