Author of the publication

Evaluating graph theoretic clustering algorithms for reliable multicasting.

, , and . GLOBECOM, page 1688-1692. IEEE, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Distributed Algorithms for Finding Small Cycle Covers in Arbitrary Networks., and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 110-118. Springer, (1994)A clustering structure for reliable multicasting., and . ICCCN, page 378-383. IEEE, (1999)A cluster-tree protocol for reliable multicasting., and . Comput. Networks, 49 (6): 707-726 (2005)Distributed Algorithms for Sparse k-Connectivity Certificates (Abstract)., and . PODC, page 180. ACM, (1996)Evaluating graph theoretic clustering algorithms for reliable multicasting., , and . GLOBECOM, page 1688-1692. IEEE, (2001)A Cluster-Ring Topology for Reliable Multicasting., , and . PDPTA, CSREA Press, (2000)Maximum Flow Problem in Distributed Environment.. SOFSEM, volume 1012 of Lecture Notes in Computer Science, page 425-430. Springer, (1995)Dynamic Detection of Forest of Tree-Connected Meshes., , and . ICPP (3), page 300-301. CRC Press, (1991)Distributed Computation and Incremental Maintainance of 3-Edge-Connected Components., and . SIROCCO, page 224-240. Carleton Scientific, (1996)A Distributed Algorithm for finding All Maximal Cliques in a Network Graph., and . LATIN, volume 583 of Lecture Notes in Computer Science, page 281-293. Springer, (1992)