Formal language constrained path problems

DOI10.1007/BFb0054371zbMath1502.68205MaRDI QIDQ5054859

Riko Jacob, Madhav V. Marathe, Chris L. Barrett

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• A generalization of Dijkstra's algorithm
• Easy problems for tree-decomposable graphs
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
• A Unified Approach to Path Problems
• Approximation Schemes for the Restricted Shortest Path Problem
• Finding Regular Simple Paths in Graph Databases
• An Incremental Algorithm for a Generalization of the Shortest-Path Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formal language constrained path problems