Add to ORKGWe propose a near-linear complexity algorithm for generating simple directed random graphs with a given degree sequence and show that this algorithm provides a means of uniform sampling for large graphs. The algorithm is applicable when the maximum degree, dmax, is asymptotically dominated by m1/4 with m being the number of edges and admits an implementation with the expected running time of the order of mdmax
AbstractThe paper studies effective approximate solutions to combinatorial counting and unform gener...
We use random sampling as a tool for solving undirected graph problems. We show that the sparse grap...
AbstractThe paper is devoted to demonstrating a randomized algorithm for determining a dominating se...
We propose a near-linear complexity algorithm for generating simple directed random graphs with a gi...
We present the fastest FPRAS for counting and randomly generating simple graphs with a given degree ...
We address here the problem of generating random graphs uniformly from the set of simple connected g...
International audienceWe address here the problem of generating random graphs uniformly from the set...
AbstractAn algorithm is presented which randomly selects a labelled graph with specified vertex degr...
We consider the algorithmic complexity of generating labeled (directed and undirected) graphs under...
Random graphs with a given degree sequence are a useful model capturing several features absent in t...
Abstract. The interactions between the components of complex networks are often directed. Proper mod...
In this paper, we provide faster algorithms for computing variousfundamental quantities associated w...
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on g...
AbstractThe paper sets out to investigate the degree sequences d1⩾d2⩾…⩾dn of random graphs of order ...
Let A = (a1, a2, ..., an) be a degree sequence of a simple bipartite graph. We present an algorithm ...
AbstractThe paper studies effective approximate solutions to combinatorial counting and unform gener...
We use random sampling as a tool for solving undirected graph problems. We show that the sparse grap...
AbstractThe paper is devoted to demonstrating a randomized algorithm for determining a dominating se...
We propose a near-linear complexity algorithm for generating simple directed random graphs with a gi...
We present the fastest FPRAS for counting and randomly generating simple graphs with a given degree ...
We address here the problem of generating random graphs uniformly from the set of simple connected g...
International audienceWe address here the problem of generating random graphs uniformly from the set...
AbstractAn algorithm is presented which randomly selects a labelled graph with specified vertex degr...
We consider the algorithmic complexity of generating labeled (directed and undirected) graphs under...
Random graphs with a given degree sequence are a useful model capturing several features absent in t...
Abstract. The interactions between the components of complex networks are often directed. Proper mod...
In this paper, we provide faster algorithms for computing variousfundamental quantities associated w...
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on g...
AbstractThe paper sets out to investigate the degree sequences d1⩾d2⩾…⩾dn of random graphs of order ...
Let A = (a1, a2, ..., an) be a degree sequence of a simple bipartite graph. We present an algorithm ...
AbstractThe paper studies effective approximate solutions to combinatorial counting and unform gener...
We use random sampling as a tool for solving undirected graph problems. We show that the sparse grap...
AbstractThe paper is devoted to demonstrating a randomized algorithm for determining a dominating se...