Maximal Common Connected Sets of Interval Graphs

Given a pair of graph G 1=(V,E 1), G 2=(V,E 2) on the same vertex set, a set S⊆ V is a maximal common connected set of G 1 and G 2 if the subgraphs of G 1 and G 2 induced by S are both connected and S is maximal the inclusion order. The maximal Common Connected sets Problem (CCP for short) consists in identifying the partition of V into maximal common connected sets of G 1 and G 2. This problem has many practical applications, notably in computational biology.

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

[2]  Maxime Crochemore,et al.  Partitioning a Graph in O(|A| log2 |V|) , 1982, Theoretical Computer Science.

[3]  HolmJacob,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001 .

[4]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[5]  Laurent Viennot,et al.  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..

[6]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[7]  Michel Habib,et al.  Chordal Graphs and Their Clique Graphs , 1995, WG.

[8]  Mathieu Raffinot,et al.  The Algorithmic of Gene Teams , 2002, WABI.

[9]  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..

[10]  G. Dirac.  On rigid circuit graphs , 1961 .

[11]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

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

[13]  Rita Casadio,et al.  Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, WABI.