198 search results - page 5 / 40 » A Sequential Algorithm for Generating Random Graphs |
134
Voted
WIA
2009
Springer
15 years 10 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
147
Voted
ALENEX
2003
15 years 5 months ago
2003
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
117
Voted
RSA
2010
15 years 2 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
126
Voted
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
This paper extends previous work on the Skewing algorithm, a promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parit...
115
Voted
LATIN
1998
Springer
15 years 7 months ago
1998
Springer
The existence of efficient algorithms to compute the eigenvectors and eigenvalues of graphs supplies a useful tool for the design of various graph algorithms. In this survey we de...