An approximation algorithm for clustering graphs with dominating diametral path.

An approximation algorithm for clustering graphs with dominating diametral path.

Dades bibliogràfiques
Publicat a:Information processing letters. 61, 3 (1997).
Autor principal: Deogun, Jitender S.
Format: Article
Idioma:English
Matèries:
Design of algorithms.
Approximation algorithms.
Graph clustering.
Special graph classes.