An efficient transitive closure algorithm for cyclic digraphs (Q1341684): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(94)90128-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2008080405
@@ Property / OpenAlex ID: W2008080405 / rank @@
+Normal rank
@@ Property / cites work @@
+A sensitive transitive closure algorithm
@@ Property / cites work: A sensitive transitive closure algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the transitive closure of a relation
@@ Property / cites work: On computing the transitive closure of a relation / rank @@
+Normal rank
@@ Property / cites work @@
+The transitive closure of a random digraph
@@ Property / cites work: The transitive closure of a random digraph / rank @@
+Normal rank
@@ Property / cites work @@
+On finding the strongly connected components in a directed graph
+Normal rank
@@ Property / cites work @@
+A transitive closure algorithm
@@ Property / cites work: A transitive closure algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+An improved transitive closure algorithm
@@ Property / cites work: An improved transitive closure algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank