scientific article
From MaRDI portal
Publication:3267904
zbMath0092.15902MaRDI QIDQ3267904
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Abstract interpretation of graphs ⋮ Computing the \(k\)-metric dimension of graphs ⋮ The limit behaviour of imprecise continuous-time Markov chains ⋮ A cascade algorithm for the logical closure of a set of binary relations ⋮ A spectral approach to the shortest path problem ⋮ On the complexity of some extended word problems defined by cancellation rules ⋮ A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices ⋮ Algebraic structures for transitive closure ⋮ Bi-criteria path problem with minimum length and maximum survival probability ⋮ Using stable sets to bound the chromatic number ⋮ Automata and rational expressions ⋮ A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion) ⋮ A cutting plane method for solving harvest scheduling models with area restrictions ⋮ Regular algebra applied to language problems