Timeline for Generating r-Regular Random Graph in Parallel
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 26, 2011 at 11:02 | vote | accept | random graphs | ||
| Aug 26, 2011 at 8:30 | answer | added | Igor Rivin | timeline score: 5 | |
| Aug 26, 2011 at 6:19 | answer | added | Daniel Mansfield | timeline score: 4 | |
| Aug 26, 2011 at 3:43 | comment | added | Andreas Blass | What sorts of random entities are available? Specifically, can you generate a random permutation? Part of my reason for asking is that the special case $r=2$ of your question is pretty close to asking for a random permutation. Another part is that conversely, for general $r$, by thinking of each vertex as having $r$ half-edges already attached, your problem becomes one of pairing up these half-edges, which looks similar to finding a random permutation of the set of half-edges (though you'd have to do something to avoid loops and multiple edges). | |
| Aug 26, 2011 at 3:04 | history | asked | random graphs | CC BY-SA 3.0 |