Routing Problems in Edge‐Colored Directed Acyclic Graphs
This paper analyzes multiple routing problems in edge‐colored directed acyclic graphs (CDAGs). Specifically, we investigate the ‐ variant of the Shortest Path Problem (SPP), the Longest Path Problem (LPP), and the Exact Path Problem (EPP) in CDAGs. Assume that we are given a colored DAG , where denotes the vertex s...