Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths
Computers and Operations Research
Information Processing Letters
The all-pairs quickest path problem
Information Processing Letters
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Introduction to Algorithms
Formal-Language-Constrained Path Problems
SIAM Journal on Computing
Sequential and Distributed Algorithms for the All Pairs Quickest Path Problem
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
A label-setting algorithm for finding a quickest path
Computers and Operations Research
A survey of algebraic properties used in cryptographic protocols
Journal of Computer Security
Language constrained graph problems: a microcosm of engineering research and development
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Complexity results on labeled shortest path problems from wireless routing metrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Given σ units of data and a digraph G = (V,E) whose edges have delays, bandwidth constraints, and are labeled by terminals from a CFG (context-free grammar) G. A path p adheres to G's path constraints iff the concatenation of all terminals along p forms a word of the language generated by G. The all-pairs quickest CFG labeled-path distance problem is: for all pairs of vertices, find the minimum path-cost to send σ data units accounting for edge delays while adhering to labeled path and bandwidth constraints. This paper iteratively applies dynamic programming-based labeled path algorithms to CFG-labeled bandwidth-stratified induced subgraphs of an input graph. More precisely, we use Rosen, Sun and Xue's quickest-path algorithm [14] as a framework giving bandwidth-stratified induced subgraphs. This approach is far more efficient than naively applying dynamic programming-based labeled path algorithms to bandwidth-augmented CFG-labeled graphs from algorithms such as Chen and Chin's [4]. Although, bandwidth-augmented graph algorithms, like Chen and Chin's, have merit for other applications of dynamic programming.