An approximation algorithm for clustering graphs with dominating diametral path

This publication has 9 references indexed in Scilit:

• Low diameter graph decompositions
  Combinatorica, 1993
• Doubly lexical ordering of dense 0–1 matrices
  Information Processing Letters, 1993
• Three Partition Refinement Algorithms
  SIAM Journal on Computing, 1987
• Organization of clustered files for consecutive retrieval
  ACM Transactions on Database Systems, 1984
• The NP-completeness column: An ongoing guide
  Journal of Algorithms, 1984
• Characterizations of strongly chordal graphs
  Discrete Mathematics, 1983
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Partitioning trees: Matching, domination, and maximum diameter
  International Journal of Parallel Programming, 1981
• Cluster Analysis and Mathematical Programming
  Journal of the American Statistical Association, 1971