Counting and selecting at random bipartite graphs with fixed degrees

DOI10.1051/RO/1990240100011MaRDI QIDQ3495378zbMATH OpenOpenAlexFDO

Authors Alain Guénoche

Publication date 1990

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/104973

zbMATH Keywords

(0,1)-matrices

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Generating random regular graphs
• Uniform generation of random regular graphs of moderate degree
• Fast uniform generation of regular graphs
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums

Cited in

(2)

• Rejection sampling of bipartite graphs with given degree sequence
• Generating random regular graphs

This page was built for publication: Counting and selecting at random bipartite graphs with fixed degrees

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