×

zbMATH — the first resource for mathematics

Counting and selecting at random bipartite graphs with fixed degrees. (English) Zbl 0711.05026
It is shown here how to enumerate (0,1)-matrices with given row and column sums. This yields a method for generating such objects at random, at least for small cases. A good iterative method for generating large instances has been by N. C. Wormald, in “Generating random regular graphs”, J. Algorithms 5, 247-280 (1984; Zbl 0543.68048).
Reviewer: C.McDiarmid

MSC:
05C30 Enumeration in graph theory
05C80 Random graphs (graph-theoretic aspects)
Keywords:
(0,1)-matrices
PDF BibTeX XML Cite
Full Text: DOI EuDML