Pages that link to "Item:Q1235010"
From MaRDI portal
The following pages link to On computing the transitive closure of a relation (Q1235010):
Displayed 5 items.
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs (Q1075771) (← links)
- On finding the strongly connected components in a directed graph (Q1313703) (← links)
- An efficient transitive closure algorithm for cyclic digraphs (Q1341684) (← links)
- Using basis dependence distance vectors in the modified Floyd-Warshall algorithm (Q2355984) (← links)
- Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm (Q2867114) (← links)