What are some good algorithms for the transitive reduction problem (either for general directed graphs or for DAGs)? In particular I am told that there are algorithms that match the running time of transitive closure algorithms. I have searched for a site that explains enough information to actually implement a solution, but I have not found one. I have also found some papers about the topic, which, unfortunately, I am not actually able to read (grrr... I want open access...)
created
last reply
- 1
reply
- 222
views
- 2
users