Timeline for Algorithm generating digraphs
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2019 at 2:49 | vote | accept | David Wang | ||
| Mar 25, 2019 at 22:29 | answer | added | Dima Pasechnik | timeline score: 3 | |
| Mar 25, 2019 at 22:14 | comment | added | David Wang | @PerAlexandersson Okay I guess that's the best algorithm I can do. There are bruce force algorithms for both generating all digraphs with n edges and identifying the isomorphic digraphs. Thanks! | |
| Mar 25, 2019 at 21:43 | comment | added | Per Alexandersson | Yes. 1) Generate all labeled digraphs whose underlying graph is not a tree. 2) Look for isomorphism, and remove copies. Both these steps can be done in finite time. You probably want to add more details to your question. | |
| Mar 25, 2019 at 21:20 | history | asked | David Wang | CC BY-SA 4.0 |