Issue No. 05 - May (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24280
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
fair edge-deletion problems; incident; node; acyclic; complexity; minimum-degree deletion graph; NP-hard; undirected; linear time; directed; computational complexity; graph theory.
S. Sahni and L. Lin, "Fair Edge Deletion Problems," in IEEE Transactions on Computers, vol. 38, no. , pp. 756-761, 1989.