Determining Minimal Set of Vertices Limiting The Maximum Path Length in General Directed Graphs

유향 그래프의 최대 경로 길이를 제한하는 최소 노드 집합을 구하는 알고리즘

A new graph problem is formulated to limit the maximum path length of a general directed graph when a minimal set of vertices together with their incident edges are removed from the graph. An optimal algorithm and a heuristic algorithm are proposed and the proposed heuristic algorithm is shown to be effective through experiments using a collection of graphs obtained from large sequential circuits. The heuristic algorithm is based on a feedback vertex set algorithm based on graph reduction.