Efficient transitive closure of sparse matrices over closed semirings (Q2368941): Difference between revisions

@@ Property / describes a project that uses @@
+Algorithm 97
@@ Property / describes a project that uses: Algorithm 97 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+WordNet
@@ Property / describes a project that uses: WordNet / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ 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/j.tcs.2005.11.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2076508696
@@ Property / OpenAlex ID: W2076508696 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest paths algorithms: Theory and experimental evaluation
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+A note on two problems in connexion with graphs
@@ Property / cites work: A note on two problems in connexion with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398334
@@ Property / cites work: Q4398334 / rank @@
+Normal rank
@@ Property / cites work @@
+New Bounds on the Complexity of the Shortest Path Problem
+Normal rank
@@ Property / cites work @@
+A heuristic improvement of the Bellman-Ford algorithm
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Shortest Paths in Sparse Networks
+Normal rank
@@ Property / cites work @@
+Q4276004
@@ Property / cites work: Q4276004 / rank @@
+Normal rank
@@ Property / cites work @@
+On practical algorithms for accelerated matrix multiplication
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast context-free grammar parsing requires fast boolean matrix multiplication
+Normal rank
@@ Property / cites work @@
+The algebraic structure of transitive closure and its application to attribute type signatures
+Normal rank
@@ Property / cites work @@
+Gaussian elimination is not optimal
@@ Property / cites work: Gaussian elimination is not optimal / 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:2368941