scientific article; zbMATH DE number 3150488
From MaRDI portal
Publication:3267904
zbMATH Open0092.15902MaRDI QIDQ3267904FDOQ3267904
Authors: Bernard Roy
Publication date: 1959
Title of this publication is not available (Why is that?)
Cited In (19)
- A cutting plane method for solving harvest scheduling models with area restrictions
- BrepMFR: enhancing machining feature recognition in B-rep models through deep learning and domain adaptation
- Algebraic structures for transitive closure
- A graph-based framework for complex system simulating and diagnosis with automatic reconfiguration
- On the complexity of some extended word problems defined by cancellation rules
- 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
- A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
- Algorithms for non-linear and stochastic resource constrained shortest path
- Using stable sets to bound the chromatic number
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
- A cascade algorithm for the logical closure of a set of binary relations
- Computing the \(k\)-metric dimension of graphs
- Abstract interpretation of graphs
- Automata and rational expressions
- An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
- Regular algebra applied to language problems
- Bi-criteria path problem with minimum length and maximum survival probability
- The limit behaviour of imprecise continuous-time Markov chains
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3267904)