An approximation algorithm for clustering graphs with dominating diametral path.

An approximation algorithm for clustering graphs with dominating diametral path.

Detalhes bibliográficos
Publicado no:Information processing letters. 61, 3 (1997).
Autor principal: Deogun, Jitender S.
Formato: Artigo
Idioma:English
Assuntos:
Design of algorithms.
Approximation algorithms.
Graph clustering.
Special graph classes.