The Exact Path Length Problem
From MaRDI portal
Publication:2777605
DOI10.1006/jagm.2001.1201zbMath1057.90049OpenAlexW2080540417MaRDI QIDQ2777605
Publication date: 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/651a2d3e5e3fa91b4459e29e80197e31a90ed606
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Efficient timed model checking for discrete-time systems ⋮ Labeled shortest paths in digraphs with negative and positive edge weights ⋮ Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting ⋮ A complete axiomatization of weighted branching bisimulation ⋮ State-based opacity of labeled real-time automata ⋮ Unnamed Item ⋮ Gap Filling as Exact Path Length Problem ⋮ Detectability of labeled weighted automata over monoids
This page was built for publication: The Exact Path Length Problem
