An approximation algorithm for clustering graphs with dominating diametral path.

An approximation algorithm for clustering graphs with dominating diametral path.

ग्रंथसूची विवरण
में प्रकाशित:Information processing letters. 61, 3 (1997).
मुख्य लेखक: Deogun, Jitender S.
स्वरूप: लेख
भाषा:English
विषय:
Design of algorithms.
Approximation algorithms.
Graph clustering.
Special graph classes.