A Theorem on Boolean Matrices (1962)

Cached

Download Links

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

Documents Related by Co-Citation

349 Algorithm 97: shortest path – R Floyd - 1962
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
17 Transitivité et connexité – B Roy - 1959
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
26 Algorithm 97 – R W Floyd - 1962
53 Graphs and Networks – B Carré - 1979
930 Categories for the Working Mathematician – S Mac Lane - 1971
279 Regular Algebra and Finite Machines – J H Conway - 1971
239 Modelling Concurrency with Partial Orders – Vaughan Pratt - 1986
622 Planning for conjunctive goals – D Chapman - 1987
412 UCPOP: A Sound, Complete, Partial Order Planner for ADL – J. Scott Penberthy, Daniel S. Weld - 1992
441 Planning in a hierarchy of abstraction spaces – E Sacerdoti - 1974
115 Transductions and Context-Free languages. Teubner-Verlag – Jean Berstel - 1979
996 Depth first search and linear graph algorithms – Robert Tarjan - 1972
1427 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
325 On a routing problem – R Bellman - 1958
69 Finite-State Transducers – Cyril Allauzen, Mehryar Mohri - 1997
125 Modeling Concurrency with Geometry – Vaughan Pratt - 1991
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979