An approximation algorithm for clustering graphs with dominating diametral path.

An approximation algorithm for clustering graphs with dominating diametral path.

Detaylı Bibliyografya
Yayımlandı:Information processing letters. 61, 3 (1997).
Yazar: Deogun, Jitender S.
Materyal Türü: Makale
Dil:English
Konular:
Design of algorithms.
Approximation algorithms.
Graph clustering.
Special graph classes.