COMPLEXITY OF SOME EDGE DELETION PROBLEMS.

Ehab S. El-Mallah, Charles Colbourn

Research output: Contribution to journalArticle

42 Citations (Scopus)

Abstract

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' epsilon 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 K//4 - e as a forbidden homeomorph or minor; and (3) H is defined by P//l, l greater than equivalent to 3, the simple path on l nodes, as a forbidden induced subgraph.

Original languageEnglish (US)
Pages (from-to)354-362
Number of pages9
JournalIEEE Transactions on Circuits and Systems
Volume35
Issue number3
DOIs
StatePublished - Mar 1988
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Cite this

COMPLEXITY OF SOME EDGE DELETION PROBLEMS. / El-Mallah, Ehab S.; Colbourn, Charles.

In: IEEE Transactions on Circuits and Systems, Vol. 35, No. 3, 03.1988, p. 354-362.

Research output: Contribution to journalArticle

@article{34972242c5ef4f499fd7580084406c9c,
title = "COMPLEXITY OF SOME EDGE DELETION PROBLEMS.",
abstract = "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' epsilon 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 K//4 - e as a forbidden homeomorph or minor; and (3) H is defined by P//l, l greater than equivalent to 3, the simple path on l nodes, as a forbidden induced subgraph.",
author = "El-Mallah, {Ehab S.} and Charles Colbourn",
year = "1988",
month = "3",
doi = "10.1109/31.1748",
language = "English (US)",
volume = "35",
pages = "354--362",
journal = "IEEE Transactions on Circuits and Systems",
issn = "0098-4094",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - COMPLEXITY OF SOME EDGE DELETION PROBLEMS.

AU - El-Mallah, Ehab S.

AU - Colbourn, Charles

PY - 1988/3

Y1 - 1988/3

N2 - 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' epsilon 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 K//4 - e as a forbidden homeomorph or minor; and (3) H is defined by P//l, l greater than equivalent to 3, the simple path on l nodes, as a forbidden induced subgraph.

AB - 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' epsilon 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 K//4 - e as a forbidden homeomorph or minor; and (3) H is defined by P//l, l greater than equivalent to 3, the simple path on l nodes, as a forbidden induced subgraph.

UR - http://www.scopus.com/inward/record.url?scp=0023981241&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0023981241&partnerID=8YFLogxK

U2 - 10.1109/31.1748

DO - 10.1109/31.1748

M3 - Article

AN - SCOPUS:0023981241

VL - 35

SP - 354

EP - 362

JO - IEEE Transactions on Circuits and Systems

JF - IEEE Transactions on Circuits and Systems

SN - 0098-4094

IS - 3

ER -