AbstractSome observations and problems concerning a model for random graphs with bounded degree are presented
AbstractConsider random graphs with n labelled vertices in which the edges are chosen independently ...
We propose the following model of a random graph on n vertices. Let F be a distribution in Rn(n−1)/2...
Two digraphs both of whose nodes consist of the set of unlabeled graphs of order n having bounded ve...
AbstractSome observations and problems concerning a model for random graphs with bounded degree are ...
AbstractStarting with n labeled vertices and no edges, introduce edges, one at a time, so as to obta...
Consider random graphs with n labelled vertices in which the edges are chosen independently and with...
Volchenkov D, Blanchard P. An algorithm generating random graphs with power law degree distributions...
Let F be a probability distribution with support on the nonnegative integers. We describe two algori...
Let F be a probability distribution with support on the nonnegative integers. We describe two algori...
We present the fastest FPRAS for counting and randomly generating simple graphs with a given degree ...
22 pages, LateX, no figureUsing a maximum entropy principle to assign a statistical weight to any gr...
Random graphs with a given degree sequence are a useful model capturing several features absent in t...
Let F be a probability distribution with support on the non-negative integers. Two algorithms are de...
We have generated sets of the problem instances obtained by using different pseudo-random methods to...
Let D be a non-negative integer-valued random variable and let G = (V, E) be an infinite transitive ...
AbstractConsider random graphs with n labelled vertices in which the edges are chosen independently ...
We propose the following model of a random graph on n vertices. Let F be a distribution in Rn(n−1)/2...
Two digraphs both of whose nodes consist of the set of unlabeled graphs of order n having bounded ve...
AbstractSome observations and problems concerning a model for random graphs with bounded degree are ...
AbstractStarting with n labeled vertices and no edges, introduce edges, one at a time, so as to obta...
Consider random graphs with n labelled vertices in which the edges are chosen independently and with...
Volchenkov D, Blanchard P. An algorithm generating random graphs with power law degree distributions...
Let F be a probability distribution with support on the nonnegative integers. We describe two algori...
Let F be a probability distribution with support on the nonnegative integers. We describe two algori...
We present the fastest FPRAS for counting and randomly generating simple graphs with a given degree ...
22 pages, LateX, no figureUsing a maximum entropy principle to assign a statistical weight to any gr...
Random graphs with a given degree sequence are a useful model capturing several features absent in t...
Let F be a probability distribution with support on the non-negative integers. Two algorithms are de...
We have generated sets of the problem instances obtained by using different pseudo-random methods to...
Let D be a non-negative integer-valued random variable and let G = (V, E) be an infinite transitive ...
AbstractConsider random graphs with n labelled vertices in which the edges are chosen independently ...
We propose the following model of a random graph on n vertices. Let F be a distribution in Rn(n−1)/2...
Two digraphs both of whose nodes consist of the set of unlabeled graphs of order n having bounded ve...
DOI
Add to ORKG