Combinatorial generation via permutation languages. IV. Elimination trees

by   Jean Cardinal, et al.

An elimination tree for a connected graph G is a rooted tree on the vertices of G obtained by choosing a root x and recursing on the connected components of G-x to produce the subtrees of x. Elimination trees appear in many guises in computer science and discrete mathematics, and they encode many interesting combinatorial objects, such as bitstrings, permutations and binary trees. We apply the recent Hartung-Hoang-Mütze-Williams combinatorial generation framework to elimination trees, and prove that all elimination trees for a chordal graph G can be generated by tree rotations using a simple greedy algorithm. This yields a short proof for the existence of Hamilton paths on graph associahedra of chordal graphs. Graph associahedra are a general class of high-dimensional polytopes introduced by Carr, Devadoss, and Postnikov, whose vertices correspond to elimination trees and whose edges correspond to tree rotations. As special cases of our results, we recover several classical Gray codes for bitstrings, permutations and binary trees, and we obtain a new Gray code for partial permutations. Our algorithm for generating all elimination trees for a chordal graph G can be implemented in time 𝒪(m+n) per generated elimination tree, where m and n are the number of edges and vertices of G, respectively. If G is a tree, we improve this to a loopless algorithm running in time 𝒪(1) per generated elimination tree. We also prove that our algorithm produces a Hamilton cycle on the graph associahedron of G, rather than just Hamilton path, if the graph G is chordal and 2-connected. Moreover, our algorithm characterizes chordality, i.e., it computes a Hamilton path on the graph associahedron of G if and only if G is chordal.



There are no comments yet.


page 10

page 26

page 31


On the Diameter of Tree Associahedra

We consider a natural notion of search trees on graphs, which we show is...

Bounds on the Diameter of Graph Associahedra

Graph associahedra are generalized permutohedra arising as special cases...

A Characterization of Individualization-Refinement Trees

Individualization-Refinement (IR) algorithms form the standard method an...

Combinatorial generation via permutation languages. I. Fundamentals

In this work we present a general and versatile algorithmic framework fo...

Subtour Elimination Constraints Imply a Matrix-Tree Theorem SDP Constraint for the TSP

De Klerk, Pasechnik, and Sotirov give a semidefinite programming constra...

Transversals of Longest Cycles in Partial k-Trees and Chordal Graphs

Let lct(G) be the minimum cardinality of a set of vertices that intersec...

Sparsified Block Elimination for Directed Laplacians

We show that the sparsified block elimination algorithm for solving undi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.