Add to ORKGLet n ~ < n2 <.- be possible orders of connected regular graphs of fixed degree k 2 3. For each i, choose a graph Xi at random from the set of all connected regular graphs of order ni and degree k. Let n(Xi) be the number of spanning trees o / Xi. Then, with probability one,!
In FOCS 2009, Kelner and Madry presented an Õ(|E|√|V | log 1/δ) algorithm for gen-erating δ-random ...
We present a practical algorithm for generating random regular graphs. For all d growing as a small ...
Thesis on the analysis of various algorithms for sampling spanning trees of a graph uniformly at ran...
Let d ≥ 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees...
We prove that if a tree T has n vertices and maximum degree at most ∆, then a copy of T can almost s...
This paper describes a probabilistic algorithm that, given a connected, undirected graph G with n ve...
Let G be a weighted directed graph where the edge weights are non-negative real numbers. An arboresc...
We consider the problem of covering the minimum spanning tree (MST) of a random subgraph of G by a s...
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning t...
We give an asymptotic expression for the expected number of spanning trees in a random graph with a...
Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a s...
We extend and strengthen the result hat, in the complete graph K, with independent random edge-lengt...
By means of analytic techniques we show that the expected number of spanning trees in a connected la...
We consider the Erdős-Rényi random graph process, which is a stochastic process that starts with n...
AbstractWe study random walks on undirected graphs with weighted edges. Our main result shows that a...
In FOCS 2009, Kelner and Madry presented an Õ(|E|√|V | log 1/δ) algorithm for gen-erating δ-random ...
We present a practical algorithm for generating random regular graphs. For all d growing as a small ...
Thesis on the analysis of various algorithms for sampling spanning trees of a graph uniformly at ran...
Let d ≥ 3 be a fixed integer. We give an asympotic formula for the expected number of spanning trees...
We prove that if a tree T has n vertices and maximum degree at most ∆, then a copy of T can almost s...
This paper describes a probabilistic algorithm that, given a connected, undirected graph G with n ve...
Let G be a weighted directed graph where the edge weights are non-negative real numbers. An arboresc...
We consider the problem of covering the minimum spanning tree (MST) of a random subgraph of G by a s...
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning t...
We give an asymptotic expression for the expected number of spanning trees in a random graph with a...
Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a s...
We extend and strengthen the result hat, in the complete graph K, with independent random edge-lengt...
By means of analytic techniques we show that the expected number of spanning trees in a connected la...
We consider the Erdős-Rényi random graph process, which is a stochastic process that starts with n...
AbstractWe study random walks on undirected graphs with weighted edges. Our main result shows that a...
In FOCS 2009, Kelner and Madry presented an Õ(|E|√|V | log 1/δ) algorithm for gen-erating δ-random ...
We present a practical algorithm for generating random regular graphs. For all d growing as a small ...
Thesis on the analysis of various algorithms for sampling spanning trees of a graph uniformly at ran...