scientific article; zbMATH DE number 871943

zbMATH Open0847.68040MaRDI QIDQ4875218FDOQ4875218

James Propp, David B. Wilson

Publication date: 28 April 1996

Title of this publication is not available (Why is that?)

Recommendations

• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• scientific article; zbMATH DE number 1256746
• Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs

zbMATH Keywords

tree sampling algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (5)

• Non-coupling from the past
• Non-uniform random spanning trees on weighted graphs
• Random walks and hyperplane arrangements
• Rayleigh processes, real trees, and root growth with re-grafting
• Generating a random sink-free orientation in quadratic time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875218)