Oracles for vertex elimination orderings

Authors:
J. Sawada
Affiliations:
Computing and Information Science, University of Guelph, Guelph, Ont., Canada
Venue:
Theoretical Computer Science
Year:
2005

Citing 5
Cited 0

Convexity in graphs and hypergraphs

SIAM Journal on Algebraic and Discrete Methods
Weak bipolarizable graphs

Discrete Mathematics - Graph colouring and variations
Generating Linear Extensions Fast

SIAM Journal on Computing
Convexity and HHD-Free Graphs

SIAM Journal on Discrete Mathematics
Generating and characterizing the perfect elimination orderings of a chordal graph

Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics

Quantified Score

Hi-index	5.23

Visualization

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.