An approximation algorithm for clustering graphs with dominating diametral path

Information Processing Letters

Volumn 61, Issue 3, 1997, Pages 121-127

  Deogun, Jitender S ^a   Kratsch, Dieter ^b   Steiner, George ^c  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^c MCMASTER UNIVERSITY   (Canada)

Author keywords

Approximation algorithms; Design of algorithms; Graph clustering; Special graph classes

Indexed keywords

EID: 0043223515     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)81663-8     Document Type: Article

References (22)

1. N. Abbas, Graph clustering: Complexity, sequential and parallel algorithms, Ph.D. Thesis, University of Alberta, Edmonton, Canada, 1995.
2. N. Abbas and L. Stewart, Clustering perfect graphs: Complexity, sequential and parallel algorithms, Manuscript, 1995.
3. A. Brandstädt, Special graph classes - A survey, Schriftenreihe des FB Mathematik, Universität Duisburg, SM-DU-199, 1991.
4. P. Brucker, On the complexity of clustering problems, in: R. Henn, B. Korte and W. Oettli, eds., Optimization and Operations Research, Lecture Notes in Economics and Mathematical Systems, Vol. 157 (Springer, New York, 1978) 45-54.
5. D.G. Corneil, S. Olariu and L. Stewart, A linear time algorithm to compute dominating pairs in asteroidal triple-free graphs, in: Proc. 22nd Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 944 (Springer, Berlin, 1995) 292-302.
6. J.S. Deogun and D. Kratsch, Diametral path graphs, Proc. 21st Internat. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 1017 (Springer, Berlin, 1995) 344-357.
7. J.S. Deogun, V.V. Raghavan and T.K.W. Tsou, Organization of clustered files for consecutive retrieval, ACM Trans. Database Systems 39 (1984) 646-671.
8. M. Farber, Characterizations of strongly chordal graphs, Discrete Math. 43 (1983) 173-189.
9. M. Farber, Domination, independent domination and duality in strongly chordal graphs, Discrete Appl. Math. 43 (1983) 115-130.
10. A. Farley, S. Hedetniemi and A. Proskurowski, Partitioning trees: matching, domination and maximum diameter, Internat. J. Comput. Inform. Sci. 10 (1981) 55-61.
11. U. Feige and J. Kilian, Zero knowledge and the chromatic number, in: Proc. 11th Ann. Conf. on Computational Complexity (1996) 278-287.
12. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freemann, New York, 1979).
13. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980).
14. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981) 169-197.
15. D.S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms 5 (1984) 147-160.
16. A. Kershenbaum, Telecommunications Network Design Algorithms (McGraw-Hill, New York, 1993).
17. N. Linial and M. Saks, Low diameter graph decompositions, Combinatorica 13 (1993) 441-454.
18. C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Proc. 25th Symp. on the Theory of Computing (1993) 286-293.
19. R. Paige and R.E. Tarjan, Three partition refinement algorithms, SIAM J. Comput. 16 (1987) 973-989.
20. M.R. Rao, Cluster analysis and mathematical programming, J. Amer. Statist. Assoc. 66 (1971) 622-626.
21. J. Spinrad, Doubly lexical ordering of dense 0-1 matrices, Inform. Process. Lett. 45 (1993) 229-235.
22. J.T. Tou and R.C. Gonzalez, Pattern Recognition Principles (Addison-Wesley, Reading, MA, 1974).