An approximation algorithm for clustering graphs with dominating diametral path.

An approximation algorithm for clustering graphs with dominating diametral path.

Bibliografiske detaljer
Udgivet i:Information processing letters. 61, 3 (1997).
Hovedforfatter: Deogun, Jitender S.
Format: Article
Sprog:English
Fag:
Design of algorithms.
Approximation algorithms.
Graph clustering.
Special graph classes.