Abstract
By maintaining appropriate data structures, we develop constant-time transposition oracles that answer whether or not two adjacent vertices in a simple elimination ordering (SEO) or a semiperfect elimination ordering (semiPEO) can be swapped to produce a new SEO or semiPEO, respectively. Combined with previous results regarding convex geometries and antimatroids, this allows us to list all SEOs of a strongly chordal graph and all semiPEOs of an HHDA-free graph in Gray code order. By applying a new amortized analysis we show that the algorithms run in constant amortized time. Additionally, we provide a simple framework that can be used to exhaustively list the basic words for other antimatroids.
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 callDisclaimer: 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.
