Non-uniform random spanning trees on weighted graphs

DOI10.1016/S0304-3975(98)00325-9zbMath0916.68107MaRDI QIDQ1292296

K. Appert

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

random walksundirected graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

GETGRATS

Cites Work

• Random walks and the effective resistance of networks
• Random walks on weighted graphs and applications to on-line algorithms
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• On a random walk problem arising in self-stabilizing token management
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-uniform random spanning trees on weighted graphs