Counting and selecting at random bipartite graphs with fixed degrees
RAIRO - Operations Research - Recherche Opérationnelle (1990)
- Volume: 24, Issue: 1, page 1-14
- ISSN: 0399-0559
Access Full Article
top
How to cite
topGuénoche, A.. "Counting and selecting at random bipartite graphs with fixed degrees." RAIRO - Operations Research - Recherche Opérationnelle 24.1 (1990): 1-14. <http://eudml.org/doc/104973>.
@article{Guénoche1990,
author = {Guénoche, A.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {(0,1)-matrices},
language = {eng},
number = {1},
pages = {1-14},
publisher = {EDP-Sciences},
title = {Counting and selecting at random bipartite graphs with fixed degrees},
url = {http://eudml.org/doc/104973},
volume = {24},
year = {1990},
}
TY - JOUR
AU - Guénoche, A.
TI - Counting and selecting at random bipartite graphs with fixed degrees
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1990
PB - EDP-Sciences
VL - 24
IS - 1
SP - 1
EP - 14
LA - eng
KW - (0,1)-matrices
UR - http://eudml.org/doc/104973
ER -
References
top- [1] Cl. BERGE, Principes de Combinatoire, Dunod, Paris, 1968. Zbl0227.05001MR237346
- [2] A. GUÉNOCHE, Énumération de classes de permutations, RAIRO Recherche Opérationnelle, Vol. 13, No. 4, 1979, pp. 379-390. Zbl0427.05004MR553271
- [3] H. NIJENHUIS & H. WILF, Combinatorial Algorithms, Acad. Press, New York, 1978. Zbl0343.68004MR510047
- [4] N. C. WORMALD, Generating random regular graphs, Journal of Algorithms, Vol. 5, No. 2, 1984, pp. 247-280. Zbl0543.68048MR744493
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.