By Topic

A graph theoretic approach in achieving robust peer-to-peer networking paradigm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shafiei, H. ; Sch. of Comput. Sci., IPM, Tehran ; Hoseini, F. ; Khonsari, A. ; Ould-Khaoua, M.

In this paper, we proposed a graph theoretic approach employing an algorithmic method to construct constant-degree graphs possessing not only provably minimum diameter, but also maximum connectivity with respect to other similar graphs.

Published in:

Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on

Date of Conference:

14-17 Oct. 2008