This Article 
 Bibliographic References 
 Add to: 
Deleting Vertices to Bound Path Length
September 1994 (vol. 43 no. 9)
pp. 1091-1096

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

[1] M. R. Garey and D. S. Johnson,Computers and Intractability. San Francisco, CA: W. H. Freeman, 1979.
[2] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[3] E. Horowitz and S. Sahni,Fundamentals of Data Structures in Pascal, 3rd Ed. Rockville, MD: Computer Science Press, 1990.
[4] M. Krishnamoorthy and N. Deo, "Node deletion NP-complete problems,"SIAM J. Computing, vol. 8, no. 4, pp. 619-625, 1979.
[5] D. Paik, S. Reddy, and S. Sahni, "Vertex splitting in dags and applications to partial scan designs and lossy circuits," Tech. Rep., Univ. of Florida, 1990.
[6] D. Paik, S. Reddy, and S. Sahni, "Heuristics for the placement of flip-flops in partial scan designs and the placement of signal boosters in lossy circuits," inProc. VLSI Design'93, 1993, pp. 45-50.

Index Terms:
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.
D. Paik, S. Reddy, S. Sahni, "Deleting Vertices to Bound Path Length," IEEE Transactions on Computers, vol. 43, no. 9, pp. 1091-1096, Sept. 1994, doi:10.1109/12.312117
Usage of this product signifies your acceptance of the Terms of Use.