Haim Kaplan, Ron Shamir, Robert E. Tarjan  Home/Search
Context Related
| math.tau.ac.il/~rshamir/pap...pwfocs.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: math.tau.ac.il/~rshamir/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the parameterized complexity of several NP-Hard graph completion problems: The MINIMUM FILL-IN problem is to decide if a graph can be triangulated by adding at most k edges. We develop an O(k 5 mn+ f(k)) algorithm for the problem on a graph with n vertices and m edges. In particular, this implies that the problem is fixed parameter tractable (FPT). PROPER INTERVAL GRAPH COMPLETION problems, motivated by molecular biology, ask for adding edges in order to obtain a proper interval... (Update)
Cited by: More
Necessary Edges in K-Chordalizations of Graphs - Hans Bodlaend Er (2000) (Correct)
Error Compensation in Leaf Root Problems - Dom, Guo, Hüffner, Niedermeier (2004) (Correct)
Parameterized Coloring Problems on Chordal Graphs - Marx (Correct)
Similar documents (at the sentence level):
14.9%: Tractability of Parameterized Completion Problems on.. - Kaplan, Shamir, Tarjan (1996) (Correct)
6.2%: Pathwidth, Bandwidth and Completion Problems to Proper.. - Kaplan, Shamir (1994) (Correct)
Active bibliography (related documents): More All
0.6: Four Strikes Against Physical Mapping of DNA - Goldberg, Golumbic, Kaplan.. (1995) (Correct)
0.4: Physical Maps and Interval Sandwich Problems: Bounded Degrees.. - Kaplan, Shamir (1996) (Correct)
0.3: Bounded Degree Interval Sandwich Problems - Kaplan, Shamir (1999) (Correct)
Similar documents based on text: More All
0.6: On the Complexity of DNA Physical Mapping - Golumbic, Kaplan, Shamir (1994) (Correct)
0.3: A Fully Dynamic Algorithm for Recognizing and Representing .. - Hell, Shamir, Sharan (2001) (Correct)
0.3: A Polynomial Approximation Algorithm for the Minimum Fill-In .. - Assaf Natanzon Ron (1998) (Correct)
Related documents from co-citation: More All
30: Fixed-parameter tractability and Completeness I: Basic Results - Downey, Fellows - 1995
18: Beyond NP-Completeness for problems of bounded width: Hardness for the W hierach.. - Bodlaender, Fellows et al. - 1994
17: Fixed-parameter tractability of graph modification problems for hereditary prope.. (context) - Cai - 1995
BibTeX entry: (Update)
Kaplan, H., Shamir, R. and Tarjan, R. E. (1994) Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping. To appear, Proceedings of the 35th Annual IEEE Conference on the Foundations of Computer Science. http://citeseer.ist.psu.edu/kaplan94tractability.html More
@inproceedings{ kaplan94tractability,
author = "Haim Kaplan and Ron Shamir and Robert Endre Tarjan",
title = "Tractability of parameterized completion problems on chordal and interval graphs: Minimum Fill-in and Physical Mapping",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "780-791",
year = "1994",
url = "citeseer.ist.psu.edu/kaplan94tractability.html" }
Citations (may not include all citations):346 Computer solution of large sparse positive definite systems (context) - George, Liu - 1981
222 Fixedparameter tractability and completeness III: Some struc.. - Downey, Fellows - 1992
202 A linear time algorithm for finding tree-decomposition of sm.. - Bodlaender - 1992
119 Simple lineartime algorithms to test chordality of graphs (context) - Tarjan, Yannakakis - 1984
93 Computing the minimum fill-in is NP-complete (context) - Yannakakis - 1981
57 A graph-theoretic study of the numerical solution of sparse .. (context) - Rose - 1972
52 Complexity results for bandwidth minimization (context) - Garey, Graham et al. - 1978
44 Mapping the genome: some combinatorial problems arising in m.. (context) - Karp - 1993
44 A handbook of integer sequences (context) - Sloane - 1973
43 Beyond NP-Completeness for problems of bounded width: Hardne.. - Bodlaender, Fellows et al.
40 Fixedparameter intractability (context) - Downey, Fellows - 1992
39 Physical mapping of chromosomes: A combinatorial problem in .. - Alizadeh, Karp et al. - 1993
38 Excluding a forest (context) - Robertson, Seymour - 1983
36 and hyperbolic geometry (context) - Sleator, Tarjan et al. - 1988
35 Graph problems related to gate matrix layout and PLA folding (context) - Mohring - 1990
32 The bandwidth minimization problem for caterpillars with hai.. (context) - Monien - 1986
26 Indifference graphs (context) - Roberts - 1969
25 bandwidth and completion problems to proper interval graphs .. (context) - Kaplan, Shamir - 1993
24 DNA physical mapping: Three ways difficult (context) - Fellows, Hallet et al. - 1993
23 Random-clone strategy for genomic restriction mapping in yea.. (context) - Olson - 1986
22 Establishing the order of human chromosome-specific DNA frag.. (context) - Carrano - 1988
22 Utrecht University (context) - Kloks, thesis et al. - 1993
19 Improved dynamic programming algorithms for the bandwidth mi.. (context) - Gurari, Sudborough - 1984
19 Dynamic programming algorithms for recognizing small-bandwid.. (context) - Saxe - 1980
18 Minimal triangulation of a graph and optimal pivoting order .. (context) - Ohtsuki, Cheung et al. - 1976
16 coli chromosome: application of a new strategy for rapid ana.. (context) - Kohara, Akiyama et al. - 1987
15 Fixed-parameter intractability II (context) - Abrahamson, Downey et al. - 1993
14 Linear time representation algorithms for proper circular ar.. (context) - Deng, Hell et al. - 1993
7 Current approaches to long-range physical mapping of the hum.. (context) - Nagaraja - 1992
4 A note on enumerating binary trees (context) - Solomon, Finkel - 1980
3 Eigenschaften der nerven homologische eihfacher familien in .. (context) - Wegner - 1967
3 Addendum: Simple linear-time algorithms to test chordality o.. (context) - Tarjan, Yannakakis - 1985
1 To appear in Advances in Applied Mathematics (context) - Golumbic, Kaplan et al. - 1993
1 Paraemterized computational feasibility (context) - Downey, Fellows - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.tau.ac.il/~rshamir/papers.html): More
An Algorithm Combining Discrete and Continuous Methods for.. - Karp, Pe'er, Shamir (Correct)
CLICK: A Clustering Algorithm for Gene Expression Analysis - Shamir, Sharan (2000) (Correct)
Approximation Algorithms For The Median Problem In The.. - Pe'er, Shamir (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