Decomposition by maxclique separators

We present a minimal counterexample to an O ( | V | | E | ) algorithm for decomposing a graph G = ( V , E ) by maximal cliques proposed by R.?Tarjan. We also present a modification to this algorithm which is correct while retaining its O ( | V | | E | ) complexity.

[1]  R. Diestel.  Graph Decompositions: A Study in Infinite Graph Theory , 1990 .

[2]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[3]  Clyde L. Monma,et al.  Intersection graphs of paths in a tree , 1986, J. Comb. Theory, Ser. B.

[4]  Anne Berry,et al.  An Introduction to Clique Minimal Separator Decomposition , 2010, Algorithms.

[5]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[6]  Hanns-Georg Leimer,et al.  Optimal decomposition by clique separators , 1993, Discret. Math..

[7]  Jeremy P. Spinrad,et al.  Efficient graph representations , 2003, Fields Institute monographs.

[8]  Reinhard Diestel,et al.  Simplicial decompositions of graphs: a survey of applications , 1989, Discret. Math..

[9]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..