Rod G. Downey, Michael R. Fellows  Home/Search
Context Related
| mcs.vuw.ac.nz/math/papers/FPTR1.ps 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: mcs.vuw.ac.nz/math/papers...FPTR1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k- DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as k-FEEDBACK VERTEX SET, exhibit fixed-parameter tractability: for each fixed k the problem is solvable in time bounded by a polynomial of degree c, where c is a constant independent of k. We establish the main results of a completeness program which addresses the... (Update)
Similar documents based on text: More All
0.8: Fixed-Parameter Tractability and Completeness II: On.. - Downey, Fellows (1994) (Correct)
0.5: The Parameterized Complexity of Some Fundamental Problems in.. - Downey, al. (1997) (Correct)
0.4: Parameterized Complexity Analysis in Computational.. - Bodlaender, Downey.. (1995) (Correct)
BibTeX entry: (Update)
R. G. Downey and M. R. Fellows, Fixed-parameter tractability and Completeness I: Basic Results, SIAM J. Comput., 24 (1995), pp. 873--921. http://citeseer.ist.psu.edu/downey95fixedparameter.html More
@article{ downey95fixedparameter,
author = "Rod G. Downey and Michael R. Fellows",
title = "Fixed-parameter tractability and completeness {II}: {On} completeness for {$W[1]$}",
journal = "Theoretical Computer Science",
volume = "141",
number = "1--2",
pages = "109--131",
year = "1995",
url = "citeseer.ist.psu.edu/downey95fixedparameter.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP -C.. (context) - Garey, Johnson - 1979
222 Fixed Parameter Tractability and Completeness IV: on Complet.. - Abrahamson, Downey et al.
222 Fixed-Parameter Tractability and Completeness - Downey, Fellows - 1992
222 Fixed Parameter Tractability and Completeness II: On Complet.. - Downey, Fellows
222 Fixed Parameter Tractability and Completeness III: Density a.. - Downey, Fellows - 1993
172 Complexity of finding embeddings in a k-tree (context) - Arnborg, Corneil et al. - 1987
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986
109 Efficient Algorithms for Combinatorial Problems on Graphs wi.. (context) - Arnborg - 1985
89 Computational Complexity of Inferring Phylogenies by Compati.. (context) - Day, Sankoff - 1986
55 The complexity of multiway cuts (context) - Dahlhaus, Johnson et al. - 1992
54 Pursuit-Evasion in a Graph (context) - Parsons - 1976
54 Ullman Introduction to Automata Theory (context) - Hopcroft - 1979
54 Two Strikes Against Perfect Phylogeny - Bodlaender, Fellows et al.
51 Nondeterminism within P (context) - Buss, Goldsmith - 1993
51 Graph Minors XIII. The Disjoint Paths Problem (context) - Robertson, Seymour
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
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