On computing the time complexity of transitive closure algorithms (Q2561238): 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(73)90010-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1974217322
@@ Property / OpenAlex ID: W1974217322 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5617548
@@ Property / cites work: Q5617548 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the time complexity of transitive closure algorithms
+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 @@
+A Theorem on Boolean Matrices
@@ Property / cites work: A Theorem on Boolean Matrices / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2561238