On computing the transitive closure of a relation (Q1235010): Difference between revisions

@@ Property / cites work @@
+Q5616735
@@ Property / cites work: Q5616735 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5616737
@@ Property / cites work: Q5616737 / rank @@
+Normal rank
@@ Property / cites work @@
+Top-down syntax nalysis
@@ Property / cites work: Top-down syntax nalysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+A transitive closure algorithm
@@ Property / cites work: A transitive closure algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Computational experiences with some transitive closure algorithms
+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
@@ Property / cites work @@
+A Theorem on Boolean Matrices
@@ Property / cites work: A Theorem on Boolean Matrices / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00271339
+Normal rank
@@ Property / OpenAlex ID @@
+W1965253335
@@ Property / OpenAlex ID: W1965253335 / rank @@
+Normal rank