Abstract
AbstractThe set of minimal vertex separators of chordal graphs is usually obtained by two‐phase algorithms. Based on properties of the lexicographic breadth‐first search, we propose a new one‐phase algorithm. We present also a characterization for planar chordal graphs; using our proposed algorithm as an initial step, the implementation of the recognition algorithm becomes trivial.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Transactions in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
