Back to Results
First PageMeta Content
Graph / Adjacency matrix / Erdős–Rényi model / Pseudoforest / Graph theory / Mathematics / Random graph


Efficient Generation of Large Random Networks∗ Vladimir Batagelj† Department of Mathematics, University of Ljubljana, Slovenia. Ulrik Brandes‡ Department of Computer & Information Science, University of Konstanz, G
Add to Reading List

Document Date: 2005-03-04 16:53:56


Open Document

File Size: 144,76 KB

Share Result on Facebook

City

Austin / Sport / /

Company

Large Random Networks / Graph Drawing Software / Cambridge University Press / /

Country

Germany / Slovenia / /

/

Facility

University of Ljubljana / University of Konstanz / /

IndustryTerm

Internet Topology Generator / present simple and efficient algorithms / superlinear algorithms / biological networks / large networks / empirical networks / social networks / /

MusicGroup

M. E. / /

Organization

Vladimir Batagelj† Department of Mathematics / Cambridge University / University of Ljubljana / American Statistical Association / Ulrik Brandes‡ Department of Computer & Information Science / European Commission / University of Konstanz / Boston University / Ministry of Education / /

Person

Vladimir Batagelj / I. Rezucha / M. E. Muller / /

Position

model for sparse undirected graphs called small worlds / Representative Internet Topology Generator / Corresponding author / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

Java / /

PublishedMedium

Journal of the American Statistical Association / /

Technology

Universal Network / Java / laptop computer / /

URL

http /

SocialTag