A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, which is an ordering of the vertices such that, for each vertex v, the neighbors of v that occur later than v in the ordering form a clique. Akcoglu et al [1] define an extension of chordal graphs whereby the neighbors of v that occur later than v in the elimination order have at most k independent vertices. We refer to such graphs as sequentially k-independent graphs. We study properties of such families of graphs, and we show that several natural classes of graphs are sequentially k-independent for small k. In particular, any intersection graph of translates of a convex object in a two dimensional plane is a sequentially 3-independent graph; furthermore, any planar graph is a sequentially 3-independent graph. For any fixed constant k, we develop simple, polynomial time approximation algorithms for sequentially k-independent graphs with respect to several well-studied NP-complete problems. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Ye, Y., & Borodin, A. (2009). Elimination Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5555 LNCS, pp. 774–785). https://doi.org/10.1007/978-3-642-02927-1_64
Mendeley helps you to discover research relevant for your work.