Edge-Deletion Problems - MaRDI portal

Cited in

(90)

Bandwidth contrained NP-complete problems
Algorithmic aspects of clique-transversal and clique-independent sets
On the skewness of Cartesian products with trees
Planarization and acyclic colorings of subcubic claw-free graphs
A simple variant of node connectivity is NP-complete
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
A spectral method for bipartizing a network and detecting a large anti-community
SPLITTING NUMBER is NP-complete
Edge-contraction problems
scientific article; zbMATH DE number 2230213 (Why is no real title available?)
On subgraph complementation to $H$-free graphs
scientific article; zbMATH DE number 2230201 (Why is no real title available?)
Minimum $d$-blockers and $d$-transversals in graphs
On the complexity of some subgraph problems
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
NP-completeness results for edge modification problems
Quantum graph drawing (best student paper)
An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
A modeling and computational study of the frustration index in signed networks
Hardness of edge-modification problems
Additive approximation of generalized Turán questions
Edge deletion problems: branching facilitated by modular decomposition
Compound logics for modification problems
Blockers and transversals
Proper interval vertex deletion
Modifying a graph using vertex elimination
The node-deletion problem for hereditary properties is NP-complete
On the computational complexity of the bipartizing matching problem
Destroying Bicolored $P_3$s by Deleting Few Edges
Local approximations for maximum partial subgraph problem.
Cutting a tree with subgraph complementation is hard, except for some small trees
Games on Graphs: Cop and Robber, Hungry Spiders, and Broadcast Domination
Parameterized complexity of finding subgraphs with hereditary properties.
Cutting a tree with subgraph complementation is hard, except for some small trees
Graph theory (algorithmic, algebraic, and metric problems)
Chordless Cycle Packing Is Fixed-Parameter Tractable
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Properties of $\pi$-skew graphs with applications
A Polynomial Kernel for Line Graph Deletion
A Polynomial Kernel for Diamond-Free Editing
A Note on the Minimum H-Subgraph Edge Deletion
The complexity of total edge domination and some related results on trees
Additive approximation for edge-deletion problems
On the approximability of the maximum common subgraph problem
Combinatorial analysis (nonnegative matrices, algorithmic problems)
$K_ i$-covers. I: Complexity and polytopes
On the parameterized complexity of graph modification to first-order logic properties
Complexity classification of some edge modification problems
A survey of parameterized algorithms and the complexity of edge modification
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
The complexity of generalized clique covering
Maximal chordal subgraphs
Matching interdiction
Parameterized aspects of strong subgraph closure
Parameterized complexity of three edge contraction problems with degree constraints
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
Restrictions of minimum spanner problems
On maximum planar induced subgraphs
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Composition of graphs and the triangle-free subgraph polytope
The approximation of maximum subgraph problems
Feedback edge sets in temporal graphs
The complexity of the reliable connectivity problem
On polynomial kernelization of $\mathcal H$-\textsc{free edge deletion}
On the complexity of the approximation of nonplanarity parameters for cubic graphs
Separator-based data reduction for signed graph balancing
On Halin subgraphs and supergraphs
Optimal edge ranking of trees in polynomial time
A Dynamic Programming Algorithm To Test A Signed Graph For Balance
Trimming forests is hard (unless they are made of stars)
Parameterized aspects of strong subgraph closure
Parameterised distance to local irregularity
Dichotomy results on the hardness of H-free edge modification problems
Vertex identification to a forest
On generating triangle-free graphs
Exploring the subexponential complexity of completion problems
Incompressibility of $H$-free edge modification problems: towards a dichotomy
Polynomial kernelization for removing induced claws and diamonds
Parameterized complexity of fair vertex evaluation problems
A balm: defend the clique-based attack from a fundamental aspect
Networks with unicyclic connected components and without short cycles
On subgraph complementation to $H$-free Graphs
Parameterized lower bound and NP-completeness of some $H$-free edge deletion problems
Listing maximal H-free subgraphs
Edge deletion to tree-like graph classes
scientific article; zbMATH DE number 7651211 (Why is no real title available?)
Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
Efficient stabilization of cooperative matching games
A min-max relation for $K_ 3$-covers in graphs noncontractible to $K_ 5\backslash e$

This page was built for publication: Edge-Deletion Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3921260)