A polynomial kernel for distance-hereditary vertex deletion
type: Item
instance of: scholarly article
title: A polynomial kernel for distance-hereditary vertex deletion
author: Eun Jung Kim
author: O-joung Kwon
published in: Algorithmica
publication date: 2021-06-30T00:00:00Z
full work available at URL: https://arxiv.org/abs/1610.07229
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 05Cxx
zbMATH DE Number: 7365272
zbMATH Keywords: parameterized complexity
zbMATH Keywords: polynomial kernel
zbMATH Keywords: distance-hereditary graph
zbMATH Keywords: rank-width
MaRDI profile type: Publication
OpenAlex ID: W2949988872
cites work: Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm
cites work: Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
cites work: Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
cites work: Distance-hereditary graphs
cites work: Transforming trees by successive local complementations
cites work: Algebraic algorithms for linear matroid parity problems
cites work: Linear time solvable optimization problems on graphs of bounded clique-width
cites work: Upper bounds to the clique width of graphs
cites work: A Combinatorial Decomposition Theory
cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
cites work: Graph Theory
cites work: A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
cites work: On Independent Circuits Contained in a Graph
cites work: On graphs without a \(C_{4}\) or a diamond
cites work: On diameters and radii of bridged graphs
cites work: Uniform Kernelization Complexity of Hitting Forbidden Minors
cites work: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
cites work: Q4471328
cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
cites work: Approximation and Kernelization for Chordal Vertex Deletion
cites work: An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion
cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Matroid matching and some applications
cites work: A Fast, Simpler Algorithm for the Matroid Parity Problem
cites work: Rank-width and vertex-minors
DOI: 10.1007/S00453-021-00820-Z
description: scientific article; zbMATH DE number 7365272