Fixed-parameter tractability of graph modification problems for hereditary properties
type: Item
instance of: scholarly article
title: Fixed-parameter tractability of graph modification problems for hereditary properties
zbMATH Open document ID: 0875.68702
DOI: 10.1016/0020-0190(96)00050-6
author: Leizhen Cai
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 984591
zbMATH Keywords: Design of algorithms
zbMATH Keywords: Graph algorithms
zbMATH Keywords: Fixed-parameter tractability
zbMATH Keywords: Graph modification problems
Wikidata QID: Q56474996
MaRDI profile type: Publication
full work available at URL: 0020-0190(96)00050-6
OpenAlex ID: W2144050783
cites work: Q5570136
cites work: Q3619797
cites work: Complement reducible graphs
cites work: Q4393480
cites work: Q4027320
cites work: Q4198056
cites work: Node-Deletion NP-Complete Problems
cites work: On the complexity of the Maximum Subgraph Problem
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Generating binary trees by transpositions
cites work: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Node-and edge-deletion NP-complete problems
cites work: Computing the Minimum Fill-In is NP-Complete
DBLP publication ID: journals/ipl/Cai96
description: scientific article; zbMATH DE number 984591