Polynomial kernels for 3-leaf power graph modification problems
- 28 August 2010
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 158 (16), 1732-1744
- https://doi.org/10.1016/j.dam.2010.07.002
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Closest 4-leaf power is fixed-parameter tractableDiscrete Applied Mathematics, 2008
- Structure and linear-time recognition of 4-leaf powersACM Transactions on Algorithms, 2008
- Invitation to data reduction and problem kernelizationACM SIGACT News, 2007
- Structure and linear time recognition of 3-leaf powersInformation Processing Letters, 2006
- Error Compensation in Leaf Power ProblemsAlgorithmica, 2005
- Graph-Modeled Data Clustering: Exact Algorithms for Clique GenerationTheory of Computing Systems, 2005
- On Graph Powers for Leaf-Labeled TreesJournal of Algorithms, 2002
- Complexity classification of some edge modification problemsDiscrete Applied Mathematics, 2001
- Tree PowersJournal of Algorithms, 1998
- Cluster analysis and mathematical programmingMathematical Programming, 1997