Sampling arborescences in parallel
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- scientific article; zbMATH DE number 3047763 (Why is no real title available?)
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A random polynomial-time algorithm for approximating the volume of convex bodies
- An almost-linear time algorithm for uniform random spanning tree generation
- Covering problems for Brownian motion on spheres
- Decomposition of regular matroids
- Determinant-preserving sparsification of SDDM matrices with applications to counting and sampling spanning trees
- Efficient volume sampling for row/column subset selection
- Fast generation of random spanning trees and the effective resistance metric
- Faster Generation of Random Spanning Trees
- Generalized loop-erased random walks and approximate reachability
- Independent sets versus perfect matchings
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- On the Vector Representations of Induced Matroids
- On unicursal paths in a network of degree 4.
- Random generation of combinatorial structures from a uniform distribution
- Random sampling of Euler tours
- Sampling random spanning trees faster than matrix multiplication
- Sensitivity of mixing times in Eulerian digraphs
- Shuffling biological sequences with motif constraints
- The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
- Two Algorithms for Unranking Arborescences
This page was built for publication: Sampling arborescences in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229372)
