Simple paths with exact and forbidden lengths
研究在带权有向多重图中寻找两个顶点间长度等于给定值或避开禁止区间的简单路径，给出了计算复杂性分类并提出了精确与近似算法。
Abstract We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.