Unit interval editing is fixed-parameter tractable
Author:
- 1 April 2017
- journal article
- Published by Elsevier in Information and Computation
- Vol. 253, 109-126
Abstract
No abstract availableAll Related Versions
This publication has 23 references indexed in Scilit:
- Forbidden induced subgraphs of normal Helly circular-arc graphs: Characterization and detectionDiscrete Applied Mathematics, 2017
- Linear Recognition of Almost Interval Graphs2015
- Chordal Editing is Fixed-Parameter TractableAlgorithmica, 2015
- A Subexponential Parameterized Algorithm for Proper Interval CompletionSIAM Journal on Discrete Mathematics, 2015
- Polynomial kernels for Proper Interval Completion and related problemsInformation and Computation, 2013
- NP-completeness results for edge modification problemsDiscrete Applied Mathematics, 2006
- On intervalizing k-colored graphs for DNA physical mappingDiscrete Applied Mathematics, 1996
- Fixed-parameter tractability of graph modification problems for hereditary propertiesInformation Processing Letters, 1996
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval GraphsSIAM Journal on Computing, 1996
- On chordal proper circular arc graphsDiscrete Mathematics, 1994