Efficient determination of the transitive closure of a directed graph (Q2547483): 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(71)90006-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2140232587
@@ Property / OpenAlex ID: W2140232587 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q29042360
@@ Property / Wikidata QID: Q29042360 / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem on Boolean Matrices
@@ Property / cites work: A Theorem on Boolean Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+A transitive closure algorithm
@@ Property / cites work: A transitive closure algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q5616735
@@ Property / cites work: Q5616735 / rank @@
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/ipl/Munro71
@@ Property / DBLP publication ID: journals/ipl/Munro71 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2547483