Fixed-parameter tractability of graph modification problems for hereditary properties
- 1 May 1996
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 58 (4), 171-176
- https://doi.org/10.1016/0020-0190(96)00050-6
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Parameterized ComplexityPublished by Springer Nature ,1999
- Generating binary trees by transpositionsJournal of Algorithms, 1990
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic HypergraphsSIAM Journal on Computing, 1985
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Computing the Minimum Fill-In is NP-CompleteSIAM Journal on Algebraic Discrete Methods, 1981
- Node-Deletion NP-Complete ProblemsSIAM Journal on Computing, 1979
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976