Random sampling of labeled tournaments
From MaRDI portal
Publication:1967114
zbMath0954.65004MaRDI QIDQ1967114
Publication date: 12 March 2000
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120783
Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Construction of all tournament matrices with prescribed row sum vector ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ The number of tournaments with the minimum number of upsets ⋮ The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
This page was built for publication: Random sampling of labeled tournaments