### Abstract

The algorithmic complexity of the graph clustering problem when restricted to special classes of graphs is investigated. We develop results showing the intractability of graph clustering and the hardness of approximating minimum graph clusterings. Our main result is a polynomial time approximation algorithm of constant worst case ratio (at most 3) which computes a k-clustering for graphs having a dominating diametral path.

Original language | English (US) |
---|---|

Pages (from-to) | 121-127 |

Number of pages | 7 |

Journal | Information Processing Letters |

Volume | 61 |

Issue number | 3 |

State | Published - Feb 14 1997 |

### Fingerprint

### Keywords

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

### ASJC Scopus subject areas

- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications

### Cite this

*Information Processing Letters*,

*61*(3), 121-127.

**An approximation algorithm for clustering graphs with dominating diametral path.** / Deogun, Jitender S.; Kratsch, Dieter; Steiner, George.

Research output: Contribution to journal › Article

*Information Processing Letters*, vol. 61, no. 3, pp. 121-127.

}

TY - JOUR

T1 - An approximation algorithm for clustering graphs with dominating diametral path

AU - Deogun, Jitender S.

AU - Kratsch, Dieter

AU - Steiner, George

PY - 1997/2/14

Y1 - 1997/2/14

N2 - The algorithmic complexity of the graph clustering problem when restricted to special classes of graphs is investigated. We develop results showing the intractability of graph clustering and the hardness of approximating minimum graph clusterings. Our main result is a polynomial time approximation algorithm of constant worst case ratio (at most 3) which computes a k-clustering for graphs having a dominating diametral path.

AB - The algorithmic complexity of the graph clustering problem when restricted to special classes of graphs is investigated. We develop results showing the intractability of graph clustering and the hardness of approximating minimum graph clusterings. Our main result is a polynomial time approximation algorithm of constant worst case ratio (at most 3) which computes a k-clustering for graphs having a dominating diametral path.

KW - Approximation algorithms

KW - Design of algorithms

KW - Graph clustering

KW - Special graph classes

UR - http://www.scopus.com/inward/record.url?scp=0043223515&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0043223515&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0043223515

VL - 61

SP - 121

EP - 127

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 3

ER -