An approximation algorithm for clustering graphs with dominating diametral path

Jitender S. Deogun, Dieter Kratsch, George Steiner

Research output: Contribution to journalArticle

26 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)121-127
Number of pages7
JournalInformation Processing Letters
Volume61
Issue number3
StatePublished - Feb 14 1997

Fingerprint

Graph Clustering
Approximation algorithms
Approximation Algorithms
Hardness
Polynomials
Path
Algorithmic Complexity
Graph in graph theory
Polynomial-time Algorithm
Clustering

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

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

In: Information Processing Letters, Vol. 61, No. 3, 14.02.1997, p. 121-127.

Research output: Contribution to journalArticle

@article{3e1234085d4f444585229177644751e4,
title = "An approximation algorithm for clustering graphs with dominating diametral path",
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.",
keywords = "Approximation algorithms, Design of algorithms, Graph clustering, Special graph classes",
author = "Deogun, {Jitender S.} and Dieter Kratsch and George Steiner",
year = "1997",
month = "2",
day = "14",
language = "English (US)",
volume = "61",
pages = "121--127",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "3",

}

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 -