A Theorem on Boolean Matrices (1962)

Cached

Download Links

by Stephen Warshall
Venue:JOURNAL OF THE ACM
Citations:212 - 0 self

Documents Related by Co-Citation

351 Algorithm 97: Shortest Path – R W Floyd - 1962
2447 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
16 Transitivité et Connexité – B Roy - 1959
8557 Introduction to Algorithms – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
25 Algorithm 97 – R W Floyd - 1962
236 Modelling Concurrency with Partial Orders – Vaughan Pratt - 1986
277 Regular Algebra and Finite Machines – J H Conway - 1971
924 Categories for the Working Mathematician – Saunders Mac Lane - 1971
54 Graphs and Networks – B Carré - 1979
623 Planning for conjunctive goals – D Chapman - 1987
415 UCPOP: A Sound, Complete, Partial Order Planner for ADL – J. Scott Penberthy, Daniel S. Weld - 1992
441 Planning in a hierarchy of abstraction spaces – Earl Sacerdoti - 1974
115 The recognition of series parallel digraphs – J Valdes, R Tarjan, E Lawler - 1982
124 Modeling Concurrency with Geometry – Vaughan Pratt
68 Finite-State Transducers – Cyril Allauzen, Mehryar Mohri - 1997
114 Transductions and Context-Free Languages. Teubner Studienbucher – J Berstel - 1979
999 Depth first search and linear graph algorithms – Robert Tarjan - 1972
1444 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
326 On a Routing Problem – R Bellman - 1958