Formal-Language-Constrained Path Problems
From MaRDI portal
Recommendations
- Formal language constrained path problems
- Engineering Label-Constrained Shortest-Path Algorithms
- Engineering label-constrained shortest-path algorithms
- On the Complexity of Universality for Partially Ordered NFAs
- UniALT for regular language contrained shortest paths on a multi-modal transportation network
Cited in
(23)- Source-tracking unification
- Local higher-order fixpoint iteration
- Engineering label-constrained shortest-path algorithms
- Topologically trivial closed walks in directed surface graphs
- Routing in multimodal transportation networks with non-scheduled lines
- A trichotomy for regular simple path queries on graphs
- scientific article; zbMATH DE number 1405617 (Why is no real title available?)
- Conflict resolving -- a local search algorithm for solving large scale conflict graphs in freight railway timetabling
- The Formal System of Dijkstra and Scholten
- Labeled cuts in graphs
- Efficient computation of shortest paths in time-dependent multi-modal networks
- Path querying with conjunctive grammars by matrix multiplication
- The shortest kinship description problem
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Time-dependent routing problems: a review
- UniALT for regular language contrained shortest paths on a multi-modal transportation network
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- Formal Derivation of a High-Trustworthy Generic Algorithmic Program for Solving a Class of Path Problems
- scientific article; zbMATH DE number 7559234 (Why is no real title available?)
- Labeled shortest paths in digraphs with negative and positive edge weights
- Perspective games
- User-constrained multimodal route planning
- Formal language constrained path problems
This page was built for publication: Formal-Language-Constrained Path Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507373)
