Issue No.09 - September (1994 vol.43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.312117
<p>Examines the vertex deletion problem for weighted directed acyclic graphs (WDAGs). The objective is to delete the fewest number of vertices so that the resulting WDAG has no path of length </spl delta/. Several simplified versions of this problem are shown to be NP-hard. However, the problem is solved in linear time when the WDAG is a rooted tree, and in quadratic time when the WDAG is a series-parallel graph.</p>
directed graphs; computational complexity; vertex deletion problem; path length bound; weighted directed acyclic graphs; NP-hard problems; linear time; rooted tree; quadratic time; series-parallel graph.
S. Reddy, S. Sahni, "Deleting Vertices to Bound Path Length", IEEE Transactions on Computers, vol.43, no. 9, pp. 1091-1096, September 1994, doi:10.1109/12.312117