Transitive closure and related semiring properties via eliminants
- 31 December 1985
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 40, 257-274
- https://doi.org/10.1016/0304-3975(85)90170-7
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- Algebraic structures for transitive closureTheoretical Computer Science, 1977
- Global Data Flow Analysis and Iterative AlgorithmsJournal of the ACM, 1976
- Regular Algebra Applied to Path-finding ProblemsIMA Journal of Applied Mathematics, 1975
- Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)Networks, 1975
- Algorithm 97: Shortest pathCommunications of the ACM, 1962
- A Theorem on Boolean MatricesJournal of the ACM, 1962
- A Note on a Generalization of Boolean Matrix TheoryThe American Mathematical Monthly, 1961
- Regular Expressions and State Graphs for AutomataIEEE Transactions on Electronic Computers, 1960