NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login

Press Enter or click the Search button to begin your search.

Back to Results
Evaluating graph theoretic clustering algorithms for reliable multicastingIn this paper, we analyze the complexities of three clustering algorithms; Lorax, k-degree, and self-adjust.
Document ID
20060031761
Acquisition Source
Jet Propulsion Laboratory
Document Type
Conference Paper
External Source(s)
hdl:2014/13108
Authors
Jennings, E. H .
Motyckova, L.
Carr, D.
Date Acquired
August 23, 2013
Publication Date
November 25, 2001
Distribution Limits
Public
Copyright
Other
Keywords
clustering algorithms complexity analysis reliable multicasting internetworking

Available Downloads

There are no available downloads for this record.

Related Records

There are no records associated with this record.
No Preview Available