By Topic

The complexity of some edge deletion problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
E. S. El-Mallah ; Waterloo Univ., Ont., Canada ; C. J. Colbourn

The edge deletion problem (EDP) corresponding to a given class H of graphs is to find the minimum number of edges the deletion of which from a given graph G results in a subgraph G', G '∈H. Previous complexity results are extended by showing that the EDP corresponding to any class H of graphs in each of the following cases is NP-hard. (1) H is defined by a set of forbidden homeomorphs or minors in which every member is a 2-connected graph with minimum degree three; (2) BH is defined by K4-e as a forbidden homeomorph or minor; and (3) H is defined by Pl , l⩾3, the simple path on l nodes, as a forbidden induced subgraph

Published in:

IEEE Transactions on Circuits and Systems  (Volume:35 ,  Issue: 3 )