Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier  Home/Search
Context
Related
| fs.informatik.unitueb...leafroots.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fs.informatik.unituebingen.de... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The k-Leaf Root problem is a particular case of graph power problems. Here, we study "error correction" versions of k-Leaf Root---that is, for instance, adding or deleting at most l edges to generate a graph that has a k-leaf root. We provide several NP-completeness results in this context, and we show that the NP-complete Closest 3Leaf Root problem (the error correction version of 3-Leaf Root) is fixed-parameter tractable with respect to the number of edge modifications in the given... (Update)
Active bibliography (related documents): More All
1.0: Fixed-Parameter Tractable Generalizations of - Cluster Editing Peter (Correct)
0.8: A Structural View on Parameterizing Problems: Distance.. - Guo, Hüffner.. (2004) (Correct)
0.8: Phylogenetic k-Root and Steiner k-Root - Lin, Kearney, Jiang (Correct)
Similar documents based on text: More All
0.4: Graph-Modeled Data Clustering: Fixed-Parameter.. - Gramm, Guo.. (2003) (Correct)
0.4: Automated Generation of Search Tree Algorithms for.. - Gramm, Guo.. (2003) (Correct)
0.3: Automated Generation of Search Tree Algorithms for.. - Gramm, Guo.. (2004) (Correct)
BibTeX entry: (Update)
@misc{ dom-error,
author = "Michael Dom and Jiong Guo and Falk Hüffner and Rolf Niedermeier",
title = "Error Compensation in Leaf Root Problems",
url = "citeseer.ist.psu.edu/dom04error.html" }
Citations (may not include all citations):308 Matrix multiplication via arithmetic progressions (context) - Coppersmith, Winograd - 1990
35 Tractability of parameterized completion problems on chordal - Kaplan, Shamir et al. - 1999
25 Fixed-parameter tractability of graph modification problems .. (context) - Cai - 1996
20 Finding a minimum circuit in a graph (context) - Itai, Rodeh - 1978
17 Correlation clustering - Bansal, Blum et al. - 2002
13 SIAM Monographs on Discrete Mathematics and Applications (context) - Brandstadt, Le and et al. - 1999
13 Algorithms for square roots of graphs - Lin, Skiena - 1995
11 Graph-modeled data clustering: Fixed-parameter algorithms fo.. - Gramm, Guo et al. - 2003
10 Cluster graph modification problems - Shamir, Sharan et al. - 2002
9 Journal of Algorithms (context) - Kearney, Corneil - 1998
8 Computing roots of graphs is hard - Motwani, Sudan - 1994
6 Automated generation of search tree algorithms for hard grap.. - Gramm, Guo et al. - 2004
5 New directions and new challenges in algorithm design and co.. (context) - Fellows - 2003
5 The maximum edge biclique problem is NP-complete - Peeters - 2003
5 Complexity and approximation of some graph modification prob.. (context) - Natanzon - 1999
4 Computing phylogenetic roots with bounded degrees and errors (context) - Chen, Jiang et al. - 2003
3 Ubiquitous parameterization---invitation to fixed-parameter .. - Niedermeier - 2004
3 NP-hard problems in hierarchical-tree clustering (context) - Krivanek, Moravek - 1986
2 root and Steiner k-root (context) - Lin, Kearney et al. - 2000
2 On graph powers for leaf-labeled trees - Nishimura, Ragde et al. - 2002
1 Bipartite roots of graphs (context) - Lau - 2004
1 the closest tree kth root problem (context) - Jiang, Lin et al. - 2000
1 Recognizing powers of proper interval (context) - Lau, Corneil - 2004
Documents on the same site (http://www-fs.informatik.uni-tuebingen.de/~hueffner/): More
Finding Optimal Solutions to Atomix - Hüffner (2002) (Correct)
Closest Strings, Primer Design, and Motif Search - Gramm, Hüffner, Niedermeier (Correct)
A Structural View on Parameterizing Problems: Distance.. - Guo, Hüffner.. (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC