Rejection sampling of bipartite graphs with given degree sequence
Let A = (a1, a2, ..., an) be a degree sequence of a simple bipartite graph. We present an algorithm that takes A as input, and outputs a simple bipartite realization of A, without stalling. The running time of the algorithm is ⊝(n1n2), where ni is the number of vertices in the part i of the bipartit...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2018-12-01
|
| Series: | Acta Universitatis Sapientiae: Mathematica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausm-2018-0020 |