An algorithm for single-source shortest paths enumeration in parameterized weighted graphs

DOI10.1007/978-3-030-68195-1_22OpenAlexW3132003515MaRDI QIDQ2232289

Bastien Sérée, Loïg Jezequel, Didier Lime

Publication date: 4 October 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-68195-1_22

zbMATH Keywords

weighted graphsshortest pathsparameterized graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• On parametric timed automata and one-counter machines
• Parametric shortest path algorithms with an application to cyclic staffing
• Two-phase algorithms for the parametric shortest path problem
• Parametric real-time reasoning
• Faster parametric shortest path and minimum‐balance algorithms
• Parameter Synthesis for Bounded Cost Reachability in Time Petri Nets

This page was built for publication: An algorithm for single-source shortest paths enumeration in parameterized weighted graphs