A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs

Distance-hereditary graphs consist of the isometric graphs, and hence contain trees and cographs. First, a canonical and compact tree representation of the class is proposed. The tree representation can be constructed in linear time using two prefix trees. Usually, the prefix trees are used to maintain a set of strings. The prefix trees in our algorithm are used to maintain the neighbors for each vertex, which is new approach comparing to the other known results based on the lexicographically bread first search. Several efficient algorithms for the distancehereditary graphs based on the canonical tree representation are proposed; linear time algorithms for graph recognition and graph isomorphism, and efficient enumeration algorithm. An efficient coding for the tree representation is also presented, which requires 4n bits for a distance-hereditary graph of n vertices, and 3n bits for a cograph. The results improve previously known upper bounds of the number of distance-hereditary graphs and cographs.

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

[2]  E. Howorka.  A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS , 1977 .

[3]  Kellogg S. Booth,et al.  A Linear Time Algorithm for Deciding Interval Graph Isomorphism , 1979, JACM.

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

[5]  Charles J. Colbourn,et al.  Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs , 1981, SIAM J. Comput..

[6]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

[7]  Hans-Jürgen Bandelt,et al.  Distance-hereditary graphs , 1986, J. Comb. Theory, Ser. B.

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

[9]  Marina Moscarini,et al.  Distance-Hereditary Graphs, Steiner Trees, and Connected Domination , 1988, SIAM J. Comput..

[10]  Guy Jacobson,et al.  Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[11]  Peter L. Hammer,et al.  Completely separable graphs , 1990, Discret. Appl. Math..

[12]  Lawrence B. Holder,et al.  Substucture Discovery in the SUBDUE System , 1994, KDD Workshop.

[13]  Venkatesh Raman,et al.  Succinct representation of balanced parentheses, static trees and planar graphs , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[14]  Gen-Huey Chen,et al.  Dynamic Programming on Distance-Hereditary Graphs , 1997, ISAAC.

[15]  A. Brandstädt,et al.  A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs , 1998 .

[16]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[17]  Takashi Washio,et al.  An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.

[18]  Ton Kloks,et al.  A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs , 2000, Discret. Appl. Math..

[19]  Michel Habib,et al.  A simple paradigm for graph recognition: application to cographs and distance hereditary graphs , 2001, Theor. Comput. Sci..

[20]  J. Ian Munro,et al.  Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..

[21]  Falk Nicolai,et al.  Homogeneous sets and domination: A linear time algorithm for distance - hereditary graphs , 2001, Networks.

[22]  Hong-Gwa Yeh,et al.  Domination in distance-hereditary graphs , 2002, Discret. Appl. Math..

[23]  Tsan-sheng Hsu,et al.  Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs , 2002, COCOON.

[24]  Shin-Ichi Nakano,et al.  Efficient generation of plane trees , 2002, Inf. Process. Lett..

[25]  Mohammed J. Zaki.  Efficiently mining frequent trees in a forest , 2002, KDD.

[26]  Michel Habib,et al.  A Simple Linear Time LexBFS Cograph Recognition Algorithm , 2003, WG.

[27]  Hiroki Arimura,et al.  Discovering Frequent Substructures in Large Unordered Trees , 2003, Discovery Science.

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

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

[30]  Shin-Ichi Nakano,et al.  Constant Time Generation of Trees with Specified Diameter , 2004, WG.

[31]  Derek G. Corneil,et al.  Lexicographic Breadth First Search - A Survey , 2004, WG.

[32]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming) , 2005 .

[33]  P. Seymour,et al.  Graphs of bounded rank-width , 2005 .

[34]  Sheng-Lung Peng,et al.  Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs , 2006, AAIM.

[35]  Naila Rahman,et al.  A simple optimal representation for balanced parentheses , 2006, Theor. Comput. Sci..

[36]  Emeric Gioan,et al.  Dynamic Distance Hereditary Graphs Using Split Decomposition , 2007, ISAAC.