JPL Technical Report Server

Evaluating graph theoretic clustering algorithms for reliable multicasting

Show simple item record

dc.contributor.author Jennings, E.H . en_US
dc.contributor.author Motyckova, L. en_US
dc.contributor.author Carr, D. en_US
dc.date.accessioned 2004-09-22T23:58:32Z
dc.date.available 2004-09-22T23:58:32Z
dc.date.issued 2001-11-25 en_US
dc.identifier.citation Globecom 2001 en_US
dc.identifier.citation San Antonio, TX, USA en_US
dc.identifier.clearanceno 01-1688 en_US
dc.identifier.uri http://hdl.handle.net/2014/13108
dc.description.abstract In this paper, we analyze the complexities of three clustering algorithms; Lorax, k-degree, and self-adjust. en_US
dc.format.extent 511349 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.subject.other clustering algorithms complexity analysis reliable multicasting internetworking en_US
dc.title Evaluating graph theoretic clustering algorithms for reliable multicasting en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account