Interval Completion Is Fixed Parameter Tractable
Work
Year: 2009
Type: article
Abstract: We present an algorithm with runtime $O(k^{2k}n^3m)$ for the following NP-complete problem [M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freem... more
Source: SIAM Journal on Computing
Institution University of International Business
Cites: 31
Cited by: 63
Related to: 10
FWCI: 6.92
Citation percentile (by year/subfield): 93.33
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green