An application of duality to edge-deletion problems
SIAM Journal on Computing
Regular Article: On the Complexity of DNA Physical Mapping
Advances in Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Graph Editing to Bipartite Interval Graphs: Exact and Asymtotic Bounds
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Edge-deletion and edge-contraction problems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Extremal Graph Theory
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Additive Approximation for Edge-Deletion Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SIAM Journal on Discrete Mathematics
The maximum edit distance from hereditary graph properties
Journal of Combinatorial Theory Series B
What is the furthest graph from a hereditary property?
Random Structures & Algorithms
Stability-type results for hereditary properties
Journal of Graph Theory
Resilience and optimization of identifiable bipartite graphs
Discrete Applied Mathematics
Hi-index | 5.23 |
For a graph property P consider the following computational problem. Given an input graph G, what is the minimum number of edge modifications (additions and/or deletions) that one has to apply to G in order to turn it into a graph that satisfies P? Namely, what is the edit distance @D(G,P) of a graph G from satisfying P? Clearly, the computational complexity of such a problem strongly depends on P. For over 30 years this family of computational problems has been studied in several contexts and various algorithms, as well as hardness results, were obtained for specific graph properties. Alon, Shapira and Sudakov studied in [N. Alon, A. Shapira, B. Sudakov, Additive approximation for edge-deletion problems, in: Proc. of the 46th IEEE FOCS, 2005, 419-428. Also: Annals of Mathematics (in press)] the approximability of the computational problem for the family of monotone graph properties, namely properties that are closed under removal of edges and vertices. They describe an efficient algorithm that achieves an o(n^2) additive approximation to @D(G,P) for any monotone property P, where G is an n-vertex input graph, and show that the problem of achieving an O(n^2^-^@e) additive approximation is NP-hard for most monotone properties. The methods in [N. Alon, A. Shapira, B. Sudakov, Additive approximation for edge-deletion problems, in: Proc. of the 46th IEEE FOCS, 2005, 419-428. Also: Annals of Mathematics (in press)] also provide a polynomial time approximation algorithm which computes @D(G,P)+/-o(n^2) for the broader family of hereditary graph properties (which are closed under removal of vertices). In this work we introduce two approaches for showing that improving upon the additive approximation achieved by this algorithm is NP-hard for several sub-families of hereditary properties. In addition, we state a conjecture on the hardness of computing the edit distance from being induced H-free for any forbidden graph H.