745 search results - page 5 / 149 » On Generating Random Network Structures: Connected Graphs |
115
click to vote
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
110
Voted
CMOT
2004
15 years 8 days ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
109
click to vote
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
CAAN
2004
Springer
15 years 5 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
133
click to vote
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...