Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs

DOI10.4064/am32-3-7zbMath1138.68663OpenAlexW2078547605MaRDI QIDQ5469348

Ludger Rüschendorf, Johannes Fehrenbach

Publication date: 18 May 2006

Published in: Applicationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/am32-3-7

zbMATH Keywords

Markov chainrandomized algorithmmulticommodity flowspanning treesconnected subgraphscanonical pathsrooted forests

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic network models in operations research (90B10) Randomized algorithms (68W20)

Related Items (1)

\(G\)-parking functions, acyclic orientations and spanning trees

This page was built for publication: Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs