A Theorem on Boolean Matrices

1962/01/01 by Stephen Warshall · 18 citations
Computer Science · #Neural Networks and Applications #Advanced Algebra and Logic #Fuzzy Logic and Control Systems

paper · doi:10.1145/321105.321107

openalex publication_date 1962/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

No abstract available.

Cited by

• An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
• The Transitive Reduction of a Directed Graph
• Weighted Automata Algorithms
• ACE: A Security Architecture for LLM-Integrated App Systems
• Isotone Optimization inR: Pool-Adjacent-Violators Algorithm (PAVA) and Active Set Methods
• Parallel graph algorithms
• Generating All Vertices of a Polyhedron Is Hard
• Boolean matrix multiplication and transitive closure
• Efficient determination of the transitive closure of a directed graph
• A transitive closure algorithm
• Graph Kernels: State-of-the-Art and Future Challenges
• A Survey of Shortest-Path Algorithms
• Approximation Limitations of Pure Dynamic Programming
• Sorting can exponentially speed up pure dynamic programming
• Common Representation of Information Flows for Dynamic Coalitions
• Improving The Floyd-Warshall All Pairs Shortest Paths Algorithm
• Blocked All-Pairs Shortest Paths Algorithm on Intel Xeon Phi KNL Processor: A Case Study
• Graph center [wikipedia]