Formal-Language-Constrained Path Problems
From MaRDI portal
Publication:4507373
DOI10.1137/S0097539798337716zbMath0968.68066MaRDI QIDQ4507373
Riko Jacob, Chris L. Barrett, Madhav V. Marathe
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
algorithmscomputational complexityshortest pathsformal languagesmulticriteria problemstransportation planningWorld Wide Webquery processing
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Transportation, logistics and supply chain management (90B06)
Related Items (15)
Labeled cuts in graphs ⋮ The shortest kinship description problem ⋮ Time-dependent routing problems: a review ⋮ Labeled shortest paths in digraphs with negative and positive edge weights ⋮ Unnamed Item ⋮ Path querying with conjunctive grammars by matrix multiplication ⋮ Topologically trivial closed walks in directed surface graphs ⋮ A trichotomy for regular simple path queries on graphs ⋮ Unnamed Item ⋮ Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling ⋮ A Parametrized Analysis of Algorithms on Hierarchical Graphs ⋮ Efficient Computation of Shortest Paths in Time-Dependent Multi-Modal Networks ⋮ User-Constrained Multimodal Route Planning ⋮ Source-tracking unification ⋮ Local higher-order fixpoint iteration
This page was built for publication: Formal-Language-Constrained Path Problems
