An application of duality to edge-deletion problems
SIAM Journal on Computing
Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
Some complexity results about threshold graphs
Discrete Applied Mathematics - Special volume: viewpoints on optimization
Regular Article: On the Complexity of DNA Physical Mapping
Advances in Applied Mathematics
Journal of Algorithms
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
On intervalizing k-colored graphs for DNA physical mapping
Discrete Applied Mathematics - Special volume on computational molecular biology
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A polynomial approximation algorithm for the minimum fill-in problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Orienting graphs to optimize reachability
Information Processing Letters
Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
The Approximation of Maximum Subgraph Problems
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Edge-deletion and edge-contraction problems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In an edge modification problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove in this paper the NP-hardness of a variety of edge modification problems with respect to some well-studied classes of graphs. These include perfect, chordal, chain, comparability, split and asteroidal triple free. We show that some of these problems become polynomial when the input graph has bounded degree. We also give a general constant factor approximation algorithm for deletion and editing problems on bounded degree graphs with respect to properties that can be characterized by a finite set of forbidden induced subgraphs.