Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs

In the literature, there are quite a few sequential and parallel algorithms to solve problems in a distance-hereditary graph G utilizing techniques discovered from the properties of the problems. Based on structural properties of G, we first sketch characteristics of problems which can be systematic solved on G and then define a general problem-solving paradigm. Given a decomposition tree representation of G, we propose a unified approach to construct sequential dynamic-programming algorithms for several fundamental graph-theoretical problems that fit into our paradigm. We also show that our sequential solutions can be efficiently parallelized using the tree contraction technique.

[1]  Elias Dahlhaus.  Optimal (Parallel) Algorithms for the All-to-All Vertices Distance Problem for Certain Graph Classes , 1992, WG.

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

[3]  Elias Dahlhaus,et al.  Efficient Parallel Recognition Algorithms of Cographs and Distance Hereditary Graphs , 1995, Discret. Appl. Math..

[4]  Sun-Yuan Hsieh.  Parallel Decomposition of Distance-Hereditary Graphs , 1999, ACPC.

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

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

[7]  Tsan-sheng Hsu,et al.  A New Simple Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs , 1998, IRREGULAR.

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

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

[10]  Feodor F. Dragan,et al.  Dominating Cliques in Distance-Hereditary Graphs , 1994, SWAT.

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

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

[13]  Tsan-sheng Hsu,et al.  Efficient Parallel Algorithms on Distance Hereditary Graphs , 1999, Parallel Process. Lett..

[14]  Erik Meineche Schmidt,et al.  Algorithm Theory — SWAT '94 , 1994, Lecture Notes in Computer Science.

[15]  David G. Kirkpatrick,et al.  A Simple Parallel Tree Contraction Algorithm , 1989, J. Algorithms.