An approximation algorithm for clustering graphs with dominating diametral path.

An approximation algorithm for clustering graphs with dominating diametral path.

Dettagli Bibliografici
Pubblicato in:Information processing letters. 61, 3 (1997).
Autore principale: Deogun, Jitender S.
Natura: Articolo
Lingua:English
Soggetti:
Design of algorithms.
Approximation algorithms.
Graph clustering.
Special graph classes.