Pages that link to "Item:Q1225062"
From MaRDI portal
The following pages link to An algorithm for finding the transitive closure of a digraph (Q1225062):
Displaying 4 items.
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- An algorithm for finding the transitive closure of a digraph (Q1225062) (← links)
- Computational experiences with some transitive closure algorithms (Q1229720) (← links)
- An improved transitive closure algorithm (Q1836309) (← links)