scientific article; zbMATH DE number 3150488

Cited in

(25)

Using stable sets to bound the chromatic number
A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
An efficient algorithm for the transitive closure and a linear worst-case complexity result for a class of sparse graphs
A cascade algorithm for the logical closure of a set of binary relations
Algebraic structures for transitive closure
Computing the \(k\)-metric dimension of graphs
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
Automata and rational expressions
Bi-criteria path problem with minimum length and maximum survival probability
Algorithms for non-linear and stochastic resource constrained shortest path
A cutting plane method for solving harvest scheduling models with area restrictions
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
The limit behaviour of imprecise continuous-time Markov chains
On the complexity of some extended word problems defined by cancellation rules
Abstract interpretation of graphs
BrepMFR: enhancing machining feature recognition in B-rep models through deep learning and domain adaptation
A graph-based framework for complex system simulating and diagnosis with automatic reconfiguration
Reachability games and friends: a journey through the Lens of memory and complexity (invited talk)
Characterizing traces of processes defined by precedence and response constraints: an order theory approach
Walk based Laplacians for modeling diffusion on complex networks
Fast Schulze voting using quickselect
The Floyd-Warshall Algorithm for Shortest Paths
Transitive closure according to Roy-Floyd-Warshall
Regular algebra applied to language problems

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)