An approximation algorithm for clustering graphs with dominating diametral path.

An approximation algorithm for clustering graphs with dominating diametral path.

Xehetasun bibliografikoak
Argitaratua izan da:Information processing letters. 61, 3 (1997).
Egile nagusia: Deogun, Jitender S.
Formatua: Artikulua
Hizkuntza:English
Gaiak:
Design of algorithms.
Approximation algorithms.
Graph clustering.
Special graph classes.