Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the Structure of Combinatorial Problems and Structure Preserving Reductions
Proceedings of the Fourth Colloquium on Automata, Languages and Programming
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On the complexity of the Maximum Subgraph Problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Graphs and Hypergraphs
IEEE Transactions on Computers
Computing minimal spanning subgraphs in linear time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
The complexity of restricted spanning tree problems
Journal of the ACM (JACM)
Linear-time computability of combinatorial problems on series-parallel graphs
Journal of the ACM (JACM)
New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
ACM Transactions on Mathematical Software (TOMS)
Transforming cyclic schemas into trees
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Lagrangian bounds in multiextremal polynomial and discrete optimization problems
Journal of Global Optimization
Bipartite density of cubic graphs
Discrete Mathematics
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
SNPs Problems, Complexity, and Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Edge-deletion and edge-contraction problems
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A note on the bounded fragmentation property and its applications in network reliability
European Journal of Combinatorics
The maximum edge biclique problem is NP-complete
Discrete Applied Mathematics
Edge-disjoint odd cycles in planar graphs
Journal of Combinatorial Theory Series B
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Consensus algorithms for the generation of all maximal bicliques
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Heuristics for the Maximum Outerplanar Subgraph Problem
Journal of Heuristics
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
On the typical case complexity of graph optimization
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
(p, k)-coloring problems in line graphs
Theoretical Computer Science
On maximum planar induced subgraphs
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Note: MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
Theoretical Computer Science
On the complexity of spill everywhere under SSA form
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
On the generation of bicliques of a graph
Discrete Applied Mathematics
On the hardness of optimization in power-law graphs
Theoretical Computer Science
Triangle-free subcubic graphs with minimum bipartite density
Journal of Combinatorial Theory Series B
The complexity of uniform Nash equilibria and related regular subgraph problems
Theoretical Computer Science
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
Journal of Discrete Algorithms
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Journal of Computer and System Sciences
Bipartite subgraphs of triangle-free subcubic graphs
Journal of Combinatorial Theory Series B
On Independent Sets and Bicliques in Graphs
Graph-Theoretic Concepts in Computer Science
Bipartite density of triangle-free subcubic graphs
Discrete Applied Mathematics
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
Compact Representation of Sets of Binary Constraints
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the complexity of some subgraph problems
Discrete Applied Mathematics
Privacy-enhanced public view for social graphs
Proceedings of the 2nd ACM workshop on Social web search and mining
On the typical case complexity of graph optimization
Discrete Applied Mathematics
Computers and Operations Research
Energy efficient monitoring in sensor networks
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Improved induced matchings in sparse graphs
Discrete Applied Mathematics
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Kernelization for cycle transversal problems
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Exact exponential-time algorithms for finding bicliques
Information Processing Letters
MAX-CUT and containment relations in graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On the small cycle transversal of planar graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On the small cycle transversal of planar graphs
Theoretical Computer Science
Global learning of typed entailment rules
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Hardness of subgraph and supergraph problems in c-tournaments
Theoretical Computer Science
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fast FPT-Algorithms for cleaning grids
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Algorithmic and complexity issues of three clustering methods in microarray data analysis
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On the NP-Completeness of some graph cluster measures
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Learning entailment relations by global graph structure optimization
Computational Linguistics
Approximation algorithms for the consecutive ones submatrix problem on sparse matrices
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Bicolored independent sets and bicliques
Information Processing Letters
On the complexity of uniformly mixed nash equilibria and related regular subgraph problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Kernelization for cycle transversal problems
Discrete Applied Mathematics
Planarization and acyclic colorings of subcubic claw-free graphs
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Note: max-cut and containment relations in graphs
Theoretical Computer Science
Contracting graphs to paths and trees
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Clique-Colouring and biclique-colouring unichord-free graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Optimal cuts in graphs and statistical mechanics
Mathematical and Computer Modelling: An International Journal
An exact algorithm for MAX-CUT in sparse graphs
Operations Research Letters
Weakly bipartite graphs and the Max-cut problem
Operations Research Letters
The max-cut problem on graphs not contractible to K5
Operations Research Letters
On the hardness of optimization in power law graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
An improved kernel for the undirected planar feedback vertex set problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Estimating population size via line graph reconstruction
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Cycle transversals in perfect graphs and cographs
Theoretical Computer Science
Post-routing layer assignment for double patterning with timing critical paths consideration
Integration, the VLSI Journal
Consistency and repair for XML write-access control policies
The VLDB Journal — The International Journal on Very Large Data Bases
Computational Optimization and Applications
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Discrete Applied Mathematics
Applying local search to the feedback vertex set problem
Journal of Heuristics
| Hi-index | 0.01 |
If &pgr; is a graph property, the general node(edge) deletion problem can be stated as follows: Find the minimum number of nodes(edges), whose deletion results in a subgraph satisfying property &pgr;. In this paper we show that if &pgr; belongs to a rather broad class of properties (the class of properties that are hereditary on induced subgraphs) then the node-deletion problem is NP-complete, and the same is true for several restrictions of it. For the same class of properties, requiring the remaining graph to be connected does not change the NP-complete status of the problem; moreover for a certain subclass, finding any "reasonable" approximation is also NP-complete. Edge-deletion problems seem to be less amenable to such generalizations. We show however that for several common properties (e.g. planar, outer-planar, line-graph, transitive digraph) the edge-deletion problem is NP-complete.