Shortest path under rational constraint

DOI10.1016/0020-0190(88)90198-6zbMath0661.68077OpenAlexW2037998882MaRDI QIDQ1113687

Jean-François Romeuf

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90198-6

zbMATH Keywords

finite automataoperational researchrational languagevaluated graphsshortest path under constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Constrained synchronization and subset synchronization problems for weakly acyclic automata ⋮ Computational complexity of synchronization under sparse regular constraints ⋮ Ideal separation and general theorems for constrained synchronization and their application to small constraint automata ⋮ CONSTRAINED SHORTEST PATH ALGORITHMS FOR NETWORK CONTROL ⋮ Constrained synchronization and commutativity ⋮ Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks

Cites Work

• An efficient Dijkstra-like labeling method for computing shortest odd/even paths
• Unnamed Item
• Unnamed Item

This page was built for publication: Shortest path under rational constraint