A Theorem on Boolean Matrices

Cited in

(only showing first 100 items - show all)

Polyadic dynamic logics for HPSG parsing
Extensions of the prudence principle to exploit a valued outranking relation
A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
A computational procedure for the asymptotic analysis of homogeneous semi-Markov processes
On negative cycles in mixed graphs
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
A non-recursive algorithm for classifying the states of a finite Markov chain
Algorithm partition and parallel recognition of general context-free languages using fixed-size VLSI architecture
Parallel and sequential computation on Boolean networks
Transitive closure and related semiring properties via eliminants
Experiments with parallel algorithms for combinatorial problems
Designing networks with compact routing tables
k-optimal solution sets for some polynomially solvable scheduling problems
A sensitive transitive closure algorithm
A new algorithm to find the shortest paths between all pairs of nodes
Polynomial algorithms to finite Veber problem for a tree network
Shortest path and closure algorithms for banded matrices
Partitioning, tearing and modification of sparse linear systems
Complete operator precedence
A cascade algorithm for the logical closure of a set of binary relations
Computational experiences with some transitive closure algorithms
Consistency in networks of relations
On computing the transitive closure of a relation
Algebraic structures for transitive closure
The ELL(1) parser generator and the error recovery mechanism
Dynamic programming and graph optimization problems
An efficient database transitive closure algorithm
Detecting causal relationships in distributed computations: In search of the holy grail
Fast algorithms for the maximum convolution problem
Simulated annealing and tabu search approaches to unidirectional flowpath design for automated guided vehicle systems
Periodic sets of integers
Proof versus formalization
The input/output complexity of transitive closure
Computing matrix period in max--min algebra
Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
Matrix period in max-algebra
Minimization algorithms for sequential transducers
Greedy can beat pure dynamic programming
Truck routing and scheduling
A cutting plane algorithm for the site layout planning problem with travel barriers
Incremental closure for systems of two variables per inequality
Computing the \(k\)-metric dimension of graphs
Special cases of the quadratic shortest path problem
Easy and optimal queries to reduce set uncertainty
An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
Consistent union and prioritized consistent union: new operations for preference aggregation
An algebraic framework for minimum spanning tree problems
Parameterized complexity of length-bounded cuts and multicuts
Facilities layout generalized model solved by n-boundary shortest path heuristics
An improved transitive closure algorithm
Networks of constraints: Fundamental properties and applications to picture processing
Searching among intervals and compact routing tables
Shortest shortest path trees of a network
Dijkstra, Floyd and Warshall meet Kleene
Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
Computing orbit period in max-min algebra
Optimal computation of shortest paths on doubly convex bipartite graphs
Linear matrix period in max-plus algebra
Revealed preference theory: an algorithmic outlook
A spectral approach to the shortest path problem
A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
Unary algebras without proper subalgebras
Efficient single-pair all-shortest-path query processing for massive dynamic networks
Multi-scale transition matrix approach to time series
Automata and rational expressions
Fast and parallel decomposition of constraint satisfaction problems
Multicriteria problems with importance-ordered criteria groups
Order batching using an approximation for the distance travelled by pickers
Extensions of dynamic programming for multi-stage combinatorial optimization
Bounds on maximum concurrent flow in random bipartite graphs
Shortest path network problems with stochastic arc weights
Bi-criteria path problem with minimum length and maximum survival probability
Subregion graph: a path planning acceleration structure for characters with various motion types in very large environments
Managing consensus based on leadership in opinion dynamics
A review and proposal of (fuzzy) clustering for nonlinearly separable data
Improved distance queries and cycle counting by Frobenius normal form
Minimal distance of propositional models
Incrementally closing octagons
Revealed preference tests for weak separability: an integer programming approach
Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures
Extreme points of the credal sets generated by comparative probabilities
Closing reciprocal relations w.r.t. stochastic transitivity
Revealed preference theory for finite choice sets
The Boolean pivot operation, \(M\)-matrices, and reducible matrices
Efficient transitive closure of sparse matrices over closed semirings
Dioïds and semirings: Links to fuzzy sets and other applications
Solving all-pairs shortest path by single-source computations: theory and practice
Incremental versus non-incremental dynamic programming
The computational complexity of rationalizing boundedly rational choice behavior
Testable implications of general equilibrium models: an integer programming approach
Universal construction mechanism for networks from one-dimensional symbol sequences
Planning temporal events using point-interval logic
Solving an urban waste collection problem using ants heuristics
Model checking propositional dynamic logic with all extras
A simplified test for preference rationality of two-commodity choice
A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
Random matrices and graphs
Efficient determination of the transitive closure of a directed graph
\({\mathfrak R}\)-Netzwerke und Matrixalgorithmen
On computing the time complexity of transitive closure algorithms

This page was built for publication: A Theorem on Boolean Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5729523)