A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs

We present a fully dynamic graph algorithm to recognize proper interval graphs that runs in O (logn ) worst case time per edge update, where n is the number of vertices in the graph. The algorithm also maintains the connected components and supports connectivity queries in O (logn ) time.

[1]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[2]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .

[3]  B. Peyton,et al.  An Introduction to Chordal Graphs and Clique Trees , 1993 .

[4]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[5]  Michael E. Lundquist.  Zero Patterns, Chordal Graphs and Matrix Completions , 1990 .

[6]  Richard C. T. Lee,et al.  Counting Clique Trees and Computing Perfect Elimination Schemes in Parallel , 1989, Inf. Process. Lett..

[7]  Wen-Lian Hsu,et al.  Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs , 1999, SIAM J. Comput..

[8]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[9]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[10]  Stephan Olariu,et al.  Simple Linear Time Recognition of Unit Interval Graphs , 1995, Inf. Process. Lett..

[11]  Roded Sharan,et al.  A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs , 2001, SIAM J. Comput..

[12]  Peter L. Hammer,et al.  Difference graphs , 1990, Discret. Appl. Math..

[13]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[14]  Louis Ibarra,et al.  Fully dynamic algorithms for chordal graphs and split graphs , 2008, TALG.

[15]  Louis Ibarra,et al.  The clique-separator graph for chordal graphs , 2009, Discret. Appl. Math..

[16]  David Eppstein,et al.  Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.

[17]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[18]  Louis Ibarra,et al.  A simple algorithm to find Hamiltonian cycles in proper interval graphs , 2009, Inf. Process. Lett..

[19]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[20]  Milan Ruzic,et al.  Uniform deterministic dictionaries , 2008, TALG.

[21]  Kenneth H. Rosen.  Handbook of Discrete and Combinatorial Mathematics , 1999 .

[22]  A. George,et al.  Graph theory and sparse matrix computation , 1993 .

[23]  Wen-Lian Hsu.  On-Line Recognition of Interval Graphs in O(m + nlog n) Time , 1995, Combinatorics and Computer Science.

[24]  Xiaotie Deng,et al.  Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs , 1996, SIAM J. Comput..

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

[26]  David Eppstein,et al.  Dynamic graph algorithms , 2010 .

[27]  Rolf H. Möhring,et al.  An Incremental Linear-Time Algorithm for Recognizing Interval Graphs , 1989, SIAM J. Comput..

[28]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[29]  Stephan Olariu,et al.  The ultimate interval graph recognition algorithm? , 1998, SODA '98.

[30]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[31]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[32]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[33]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[34]  J. G. Lewis,et al.  A fast algorithm for reordering sparse matrices for parallel factorization , 1989 .

[35]  Michel Deza,et al.  Combinatorics and Computer Science , 1996, Lecture Notes in Computer Science.