PDCAT
2004
Springer
14 years 5 months ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...