An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs
Authors:
- 22 February 2021
- book chapter
- Published by Springer Nature
- p. 279-290
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Parametric Analyses of Attack-Fault Trees2019
- Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets2019
- Minimal-Time Synthesis for Parametric Timed Automata2019
- On parametric timed automata and one-counter machinesInformation and Computation, 2017
- Parametric real-time reasoning1993
- Faster parametric shortest path and minimum‐balance algorithmsNetworks, 1991
- Parametric shortest path algorithms with an application to cyclic staffingDiscrete Applied Mathematics, 1981