Efficient and simple generation of random simple connected graphs with prescribed degree sequence

By Fabien Viger, Matthieu Latapy. J. Complex Networks, 2005

300 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/ff07d1cd3796328050dc6d2c13910fcb61afbe7c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Steven S. Skiena
2. Bryan Perozzi
3. William L. Hamilton
4. Jure Leskovec
5. Stephan Günnemann
6. Philip S. Yu
7. Jian Tang
8. Aleksandar Bojchevski

In Computational Theory and Mathematics

1. Steven S. Skiena
2. Louis H. Rowen
3. Zur Izhakian

In Discrete Mathematics and Combinatorics

1. Steven S. Skiena

Citations in the corpus

• The Algorithm Design Manual (2020, background): “Viger [VL05] has made available a C++ implementation of his algorithm to generate simple connected graphs with a prescribed degree sequence.”