This Article 
 Bibliographic References 
 Add to: 
Fair Edge Deletion Problems
May 1989 (vol. 38 no. 5)
pp. 756-761
The notation of fair edge-deletion problems is introduced. These arise when it is desirable to control the number of edges incident to any node that are either deleted or remain following edge deletion. Six such problems were formulated for the case where the resultant graph is known to be acyclic, and the complexity of four of these is easily determined from known results. The remaining two ar

[1] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[2] E. Horowitz and S. Sahni,Fundamentals of Data Structures. Rockville, MD: Computer Science Press, 1983.
[3] M. S. Krishnamoorthy and N. Deo, "Node-deletion NP-complete problems,"SIAM J. Comput., vol. 8, pp. 619-625, Nov. 1979.
[4] M. Yannakakis, "Node- and edge-deletion NP-complete problems," inProc. 10th Annu. ACM Symp. Theory Comput., ACM, New York, 1978, pp. 253-264.

Index Terms:
fair edge-deletion problems; incident; node; acyclic; complexity; minimum-degree deletion graph; NP-hard; undirected; linear time; directed; computational complexity; graph theory.
L. Lin, S. Sahni, "Fair Edge Deletion Problems," IEEE Transactions on Computers, vol. 38, no. 5, pp. 756-761, May 1989, doi:10.1109/12.24280
Usage of this product signifies your acceptance of the Terms of Use.