Efficient transitive closure of sparse matrices over closed semirings

Theoretical Computer Science

Volumn 354, Issue 1, 2006, Pages 72-81

  Penn, Gerald ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Dijkstra's algorithm; Parsing; Semirings; Sparse matrix multiplication; Typed feature logic

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATION THEORY; DATA STRUCTURES; LINGUISTICS; SET THEORY;

DIJKSTRA'S ALGORITHM; PARSING; SEMIRINGS; SPARSE MATRIX MULTIPLICATION; TYPED FEATURE LOGIC;

MATRIX ALGEBRA;

EID: 33644623158     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.11.008     Document Type: Conference Paper

References (23)

1. A. Aho, J. Hopcroft, and J. Ullman The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Reading, MA
2. H. Aït-Kaći, R. Boyer, P. Lincoln, and R. Nasr Efficient implementation of lattice operations ACM Trans. Progr. Lang. Sys. 11 1 1989 115 146
3. J. Bentley Programming Pearls 1986 Addison-Wesley Reading, MA
4. B. Carpenter, and G. Penn Compiling typed attribute-value logic grammars H. Bunt M. Tomita Recent Advances in Parsing Technologies 1996 Kluwer Dordrecht 145 168 see also http://www.ale.cs.toronto.edu
5. B.V. Cherkassky, A.V. Goldberg, and T. Radzik Shortest paths algorithms: theory and experimental evaluation Math. Program. 73 2 1996 129 174
6. D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progressions J. Symb. Comput. 9 3 1990 251 280
7. E.W. Dijkstra A note on two problems in connexion with graphs Numer. Math. 1 1959 269 271
8. C. Fellbaum, (Ed.), WordNet: An Electronic Lexical Database, MIT Press, Cambridge, MA, 1998, see also http://www.cogsci.princeton.edu/ ∼ wn.
9. D. Flickinger On building a more efficient grammar by exploiting types Natural Lang. Eng. 6 1 2000 15 28 see also http://lingo.stanford.edu/erg.html
10. R.W. Floyd Algorithm 97 (shortest path) Comm. ACM 5 6 1962 345
11. M.L. Fredman New bounds on the complexity of the shortest path problem SIAM J. Comput. 5 1 1976 83 89
12. A.V. Goldberg, and T. Radzik A heuristic improvement of the bellman-ford algorithm Appl. Math. Lett. 6 1993 3 6
13. J. Goodman Semiring parsing Comput. Linguist. 25 4 1999 573 605
14. D.B. Johnson Efficient algorithms for shortest paths in sparse networks J. Assoc. Comput. Mach. 24 1 1977 1 13
15. D.S. Johnson, C.C. McGeoch, (Eds.), Network flows and matching: first DIMACS implementation challenge, Series in Discrete Mathematics and Theoretical Computer Science, Vol. 12, American Mathematical Society, Providence, RI, 1991.
16. J. Laderman, V. Pan, and X.-H. Sha On practical algorithms for accelerated matrix multiplication Linear Algebra Appl. 162-164 1992 557 588
17. E.L. Lawler Combinatorial Optimization: Networks and Matroids 1976 Holt, Rinehart and Winston New York
18. L. Lee Fast context-free grammar parsing requires fast Boolean matrix multiplication J. ACM 49 1 2002 1 15
19. G. Penn The algebraic structure of transitive closure and its application to attributed type signatures Grammars 3 2-3 2000 295 312
20. W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling Numerical Recipes in C: The Art of Scientific Computing second ed. 1993 Cambridge University Press Cambridge
21. A.L. Rector, J.E. Rogers, and P. Pole The GALEN high-level ontology Proc. 14th Internat. Congr. of the European Federation for Medical Informatics (MIE-96), Part A IOS Press 1996 174 178 see also http://www.opengalen.org
22. V. Strassen Gaussian elimination is not optimal Numer. Math. 14 3 1969 354 356
23. S. Warshall A theorem on Boolean matrices J. ACM 9 1 1962 11 12