Timeline for Remove redundant dependencies from a directed acyclic graph
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 10, 2019 at 8:54 | comment | added | Evgeny Zislis | The action that does this is called Transitive Reduction, explained in detail at en.wikipedia.org/wiki/Transitive_reduction | |
| Oct 2, 2017 at 2:58 | answer | added | kglr | timeline score: 3 | |
| Oct 18, 2013 at 14:01 | vote | accept | asterix314 | ||
| Oct 10, 2013 at 15:42 | comment | added | asterix314 | The solutions people have contributed are all of the "roll your own" type. It's a pity the rich set of graph algorithms in Mathematica are left unutilized for this question while we start from scratch. | |
| Oct 10, 2013 at 15:19 | answer | added | asterix314 | timeline score: 11 | |
| Oct 8, 2013 at 12:16 | vote | accept | asterix314 | ||
| Oct 18, 2013 at 14:01 | |||||
| Oct 8, 2013 at 9:40 | answer | added | István Zachar | timeline score: 6 | |
| Oct 8, 2013 at 9:11 | vote | accept | asterix314 | ||
| Oct 8, 2013 at 12:16 | |||||
| Oct 8, 2013 at 6:45 | history | edited | m_goldberg | CC BY-SA 3.0 |
General cleanup
|
| Oct 8, 2013 at 6:40 | answer | added | Kuba | timeline score: 7 | |
| Oct 8, 2013 at 6:34 | comment | added | Yves Klett | Including working code and showing what you already tried and what your input/output should look like will improve your chances to get an answer and make this question more useful for future visitors. At the moment there is about no Mathematica reference, too. | |
| Oct 8, 2013 at 6:21 | comment | added | asterix314 | Algorithms I've looked at: minimum spanning tree, edge/vertex cover, shortest paths. But they are not what I'm looking for. | |
| Oct 8, 2013 at 6:20 | history | tweeted | twitter.com/#!/StackMma/status/387462512163450880 | ||
| Oct 8, 2013 at 6:02 | history | asked | asterix314 | CC BY-SA 3.0 |