Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

In this paper, we sketch common properties of a class of so-called subgraph optimization problems that can be systematically solved on distance-hereditary graphs. Based on the found properties, we then develop a general problem-solving paradigm that solves these problems efficiently in parallel. As a by-product, we also obtain new linear-time algorithms by a sequential simulation of our parallel algorithms. Let Td|V|,|E|) and Pd(|V|,|E|) denote the time and processor complexities, respectively, required to construct a decomposition tree of a distance-hereditary graph G=(V,E) on a PRAM model Md. Based on the proposed paradigm, we show that the maximum independent set problem, the maximum clique problem, the vertex connectivity problem, the domination problem, and the independent domination problem can be sequentially solved in O(|V|+|E|) time, and solved in parallel in O(Td(|V|,|E|)+log |V|) time using O(Pd(|V|,|E|)+|V|log |V|)processors on Md. By constructing a decomposition tree under a CREW PRAM, we also show that Td(|V|,|E|)=O(log2|V|) and Pd(|V|,|E|)=O(|V|+|E|).

[1]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[2]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

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

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

[5]  Udi Rotics,et al.  On the Clique-Width of Perfect Graph Classes , 1999, WG.

[6]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[7]  Hong-Gwa Yeh,et al.  Weighted Connected Domination and Steiner Trees in Distance-Hereditary Graphs , 1995, Combinatorics and Computer Science.

[8]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[9]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[10]  Stephan Olariu,et al.  An optimal parallel matching algorithm for cographs , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[11]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.

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

[13]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[14]  Xin He,et al.  Parallel Algorithm for Cograph Recognition with Applications , 1992, J. Algorithms.

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

[16]  Torben Hagerup,et al.  Parallel Algorithms with Optimal Speedup for Bounded Treewidth , 1995, SIAM J. Comput..

[17]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.

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

[19]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[20]  Tsan-sheng Hsu,et al.  A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs , 2000, J. Algorithms.

[21]  Feodor F. Dragan,et al.  A linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs , 1998, Networks.

[22]  Gary L. Miller,et al.  Tree-Based Parallel Algorithm Design , 1997, Algorithmica.

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

[24]  G. Chang,et al.  THE PATH-PARTITION PROBLEM IN BIPARTITE DISTANCE-HEREDITARY GRAPHS , 1998 .

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

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

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

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