An approximation algorithm for clustering graphs with dominating diametral path.

An approximation algorithm for clustering graphs with dominating diametral path.

Bibliografski detalji
Izdano u:Information processing letters. 61, 3 (1997).
Glavni autor: Deogun, Jitender S.
Format: Članak
Jezik:English
Teme:
Design of algorithms.
Approximation algorithms.
Graph clustering.
Special graph classes.