TY  - JOUR
T1  - An approximation algorithm for clustering graphs with dominating diametral path.
JF  - Information processing letters.
A1  - Deogun, Jitender S.
LA  - English
UL  - https://tuklas.up.edu.ph/Record/UP-99796217608727115
KW  - Design of algorithms.
KW  - Approximation algorithms.
KW  - Graph clustering.
KW  - Special graph classes.
ER  -