On reshaping of clustering coefficients in degree-based topology generators Conference Paper

abstract

• Recent work has shown that the Internet exhibits a powerlaw node degree distribution and high clustering. Considering that many existing degree-based Internet topology generators do not achieve this level of clustering, we propose a randomized algorithm that increases the clustering coefficients of graphs produced by these generators. Simulation results confirm that our algorithm makes the graphs produced by existing generators match clustering properties of the Internet topology. Springer-Verlag 2004.

authors

• Loguinov, Dmitri

published proceedings

• ALGORITHMS AND MODELS FOR THE WEB-GRAPHS, PROCEEDINGS

author list (cited authors)

• Li, X. F., Leonard, D., & Loguinov, D.

citation count

• 2

complete list of authors

• Li, XF||Leonard, D||Loguinov, D

editor list (cited editors)

• Leonardi, S.

publication date

• December 2004

publisher

• Springer Nature  Publisher

published in

• Lecture Notes in Computer Science  Journal

keywords

• 46 Information And Computing Sciences
• 4605 Data Management And Data Science

Digital Object Identifier (DOI)

• 10.1007/978-3-540-30216-2_6

International Standard Book Number (ISBN) 10

• 3-540-23427-6

International Standard Book Number (ISBN) 13

• 9783540234272

start page

• 68

end page

• 79

volume

• 3243

URL

• http://dx.doi.org/10.1007/978-3-540-30216-2_6