Results 1  10
of
32
Complexity classification of some edge modification problems
, 2001
"... In an edge modification problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NPhardness of a variety of edge modification problems with respect to some wellstudied classes of graphs. These include perfect, chordal, chain, c ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
In an edge modification problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NPhardness of a variety of edge modification problems with respect to some wellstudied classes of graphs. These include perfect, chordal, chain, comparability, split and asteroidal triple free. We show that some of these problems become polynomial when the input graph has bounded degree. We also give a general constant factor approximation algorithm for deletion and editing problems on bounded degree graphs with respect to properties that can be characterized by a finite set of forbidden induced subgraphs.
Pathwidth, Bandwidth and Completion Problems to Proper Interval Graphs with Small Cliques
 SIAM Journal on Computing
, 1996
"... We study two related problems motivated by molecular biology: ffl Given a graph G and a constant k, does there exist a supergraph G of G which is a unit interval graph and has clique size at most k? ffl Given a graph G and a proper kcoloring c of G, does there exist a supergraph We show th ..."
Abstract

Cited by 29 (6 self)
 Add to MetaCart
We study two related problems motivated by molecular biology: ffl Given a graph G and a constant k, does there exist a supergraph G of G which is a unit interval graph and has clique size at most k? ffl Given a graph G and a proper kcoloring c of G, does there exist a supergraph We show that those problems are polynomial for fixed k. On the other hand we prove that the first problem is equivalent to deciding if the bandwidth of G is at most k \Gamma 1. Hence, it is NPhard, and W [t]hard for all t. We also show that the second problem is W [1]hard. This implies that for fixed k, both of the problems are unlikely to have an O(n ) algorithm, where ff is a constant independent of k.
Minimal triangulations of graphs: A survey
 Discrete Mathematics
"... Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal triangulations, which are the result of adding an inclusion minimal set of edges to produce a triangulation. This topic was ..."
Abstract

Cited by 25 (3 self)
 Add to MetaCart
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal triangulations, which are the result of adding an inclusion minimal set of edges to produce a triangulation. This topic was first studied from the standpoint of sparse matrices and vertex elimination in graphs. Today we know that minimal triangulations are closely related to minimal separators of the input graph. Since the first papers presenting minimal triangulation algorithms appeared in 1976, several characterizations of minimal triangulations have been proved, and a variety of algorithms exist for computing minimal triangulations of both general and restricted graph classes. This survey presents and ties together these results in a unified modern notation, keeping an emphasis on the algorithms. 1 Introduction and
Exact (exponential) algorithms for treewidth and minimum fillin
 In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004
, 2004
"... minimum fillin ..."
A Polynomial Approximation Algorithm for the Minimum FillIn Problem
, 1998
"... In the minimum fillin problem, one wishes to find a set of edges of smallest size, whose addition to a given graph will make it chordal. The problem has important applications in numerical algebra and has been studied intensively since the 1970s. We give the first polynomial approximation algorithm ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
In the minimum fillin problem, one wishes to find a set of edges of smallest size, whose addition to a given graph will make it chordal. The problem has important applications in numerical algebra and has been studied intensively since the 1970s. We give the first polynomial approximation algorithm for the problem. Our algorithm constructs a triangulation whose size is at most eight times the optimum size squared. The algorithm builds on the recent parameterized algorithm of Kaplan, Shamir and Tarjan for the same problem. For bounded degree graphs we give a polynomial approximation algorithm with a polylogarithmic approximation ratio. We also improve the parameterized algorithm.
Chordal deletion is fixedparameter tractable
 In 32nd International Workshop on GraphTheoretic Concepts in Computer Science, WG 2006, LNCS Proceedings
, 2004
"... Abstract. It is known to be NPhard to decide whether a graph can be made chordal by the deletion of k vertices. Here we present a uniformly polynomialtime algorithm for the problem: the running time is f(k) ·n α for some constant α not depending on k and some f depending only on k. For large value ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Abstract. It is known to be NPhard to decide whether a graph can be made chordal by the deletion of k vertices. Here we present a uniformly polynomialtime algorithm for the problem: the running time is f(k) ·n α for some constant α not depending on k and some f depending only on k. For large values of n, such an algorithm is much better than trying all the O(n k) possibilities. Therefore, the chordal deletion problem parameterized by the number k of vertices to be deleted is fixedparameter tractable. This answers an open question of Cai [2]. 1
GraphModeled Data Clustering: FixedParameter Algorithms for Clique Generation
 In Proc. 5th CIAC, volume 2653 of LNCS
, 2003
"... We present e#cient fixedparameter algorithms for the NPcomplete edge modification problems Cluster Editing and Cluster Deletion. ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
We present e#cient fixedparameter algorithms for the NPcomplete edge modification problems Cluster Editing and Cluster Deletion.
Fast FixedParameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
, 2003
"... Our goal in this paper is the development of fast algorithms for recognizing general classes of graphs. We seek algorithms whose complexity can be expressed as a linear function of the graph size plus an exponential function of k, a natural parameter describing the class. In particular, we consider ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
Our goal in this paper is the development of fast algorithms for recognizing general classes of graphs. We seek algorithms whose complexity can be expressed as a linear function of the graph size plus an exponential function of k, a natural parameter describing the class. In particular, we consider the class W_k(G), where for each graph G in W_k(G), the removal of a set of at most k vertices from G results in a graph in the base graph class G. (If G ist the class of edgeless graphs,...