Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms

We study a group of clustering problems on bipartite and chordal graphs. Our objective is to partition the vertices of a graph into a restricted number of sets so that a prespecified, diameter related, objective function is minimized. We unify a few problems using monotone diameterfunctions defined on sub-partitions of a graph. Among these problems are the following: partition vertices of a graph into a restricted number of subgraphs of bounded diameter, and partition vertices of a graph into a restricted number of subgraphs so the sum of the diameters of the subgraphs is bounded. We show that the first of the aforementioned problems is NP-complete on bipartite and chordal graphs, but has linear time sequential solutions on interval and bipartite permutation graphs. As well, we show that the unified problem has an NC parallel algorithm on interval graphs. © 1999 Publishedby Elsevier B.V. ALL rights reserved.

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

[2]  Wojciech Rytter,et al.  Efficient parallel algorithms , 1988 .

[3]  Jeremy P. Spinrad,et al.  Bipartite permutation graphs , 1987, Discret. Appl. Math..

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

[5]  Alan A. Bertossi,et al.  Some parallel algorithms on interval graphs , 1987, Discret. Appl. Math..

[6]  Jitender S. Deogun,et al.  An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path , 1997, Inf. Process. Lett..

[7]  Lorna Stewart,et al.  Graph clustering: complexity, sequential and parallel algorithms , 1995 .

[8]  Sartaj Sahni,et al.  A parallel matching algorithm for convex bipartite graphs and applications to scheduling , 1984, J. Parallel Distributed Comput..

[9]  Martin Farber,et al.  Characterizations of strongly chordal graphs , 1983, Discret. Math..

[10]  Martin Farber,et al.  Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..

[11]  N Linial,et al.  Low diameter graph decompositions , 1993, Comb..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[14]  Mirka Miller,et al.  A characterization of strongly chordal graphs , 1998, Discret. Math..

[15]  F. Glover.  Maximum matching in a convex bipartite graph , 1967 .

[16]  Philip N. Klein,et al.  Efficient parallel algorithms for chordal graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[17]  S. Poljak.  A note on stable sets and colorings of graphs , 1974 .

[18]  D. West.  Introduction to Graph Theory , 1995 .

[19]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .

[20]  Selim G. Akl,et al.  Design and analysis of parallel algorithms , 1985 .

[21]  Abha Moitra,et al.  Parallel Algorithms For Maximum Matching And Other Problems On Interval Graphs , 1988 .

[22]  Jitender S. Deogun,et al.  Diametral Path Graphs , 1995, WG.

[23]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Yehoshua Perl,et al.  Circuit partitioning with size and connection constraints , 1983, Networks.

[25]  Stephan Olariu,et al.  Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals , 1992, IEEE Trans. Parallel Distributed Syst..