Results 1  10
of
11
Approximation and Tidying  A Problem Kernel for sPlex Cluster Vertex Deletion
 ALGORITHMICA
, 2011
"... We introduce the NPhard graphbased data clustering problem sPLEX CLUSTER VERTEX DELETION, where the task is to delete at most k vertices from a graph so that the connected components of the resulting graph are splexes. In an splex, every vertex has an edge to all but at most s−1 other vertice ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
vertices; cliques are 1plexes. We propose a new method based on “approximation and tidying ” for kernelizing vertex deletion problems whose goal graphs can be characterized by forbidden induced subgraphs. The method exploits polynomialtime approximation results and thus provides a useful link between
PlanarF Deletion: Approximation, Kernelization and Optimal FPT Algorithms
"... Let F be a finite set of graphs. In the FDeletion problem, we are given an nvertex graph G and an integer k as input, and asked whether at most k vertices can be deleted from G such that the resulting graph does not contain a graph from F as a minor. FDeletion is a generic problem and by selectin ..."
Abstract

Cited by 18 (8 self)
 Add to MetaCart
Let F be a finite set of graphs. In the FDeletion problem, we are given an nvertex graph G and an integer k as input, and asked whether at most k vertices can be deleted from G such that the resulting graph does not contain a graph from F as a minor. FDeletion is a generic problem
Hitting forbidden minors: Approximation and kernelization
 IN PROCEEDINGS OF THE 8TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011
"... We study a general class of problems called FDeletion problems. In an FDeletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such that the resulting graph does not contain as a minor any graph from the family F of forbidden minors. We obtain a number o ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
of algorithmic results on the FDeletion problem when F contains a planar graph. We give • a linear vertex kernel on graphs excluding tclaw K1,t, the star with t leves, as an induced subgraph, where t is a fixed integer. • an approximation algorithm achieving an approximation ratio of O(log 3/2 OPT), where OPT
Kernelization Through Tidying  A Case Study Based on sPlex Cluster Vertex Deletion
 PROC. 9TH LATIN
, 2010
"... We introduce the NPhard graphbased data clustering problem sPlex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the connected components of the resulting graph are splexes. In an splex, every vertex has an edge to all but at most s − 1 other verti ..."
Abstract
 Add to MetaCart
vertices; cliques are 1plexes. We propose a new method for kernelizing a large class of vertex deletion problems and illustrate it by developing an O(k 2 s 3)vertex problem kernel for sPlex Cluster Vertex Deletion that can be computed in O(ksn 2) time, where n is the number of graph vertices
Finding transitive approximations of . . .
, 2009
"... In Bioinformatics, the task of hierarchically classifying diseases with noisy data recently led to studying the Transitivity Editing problem, which is to change a given digraph by adding and removing a minimum number of arcs such that the resulting digraph is transitive. We show that both Transitivi ..."
Abstract
 Add to MetaCart
Transitivity Editing and Transitivity Deletion, which does not allow the insertion of arcs, are NPcomplete even when restricted to DAGs. We provide polynomialtime executable data reduction rules that yield an O(k²)vertex kernel for general digraphs and an O(k)vertex kernel for digraphs of bounded degree
Kernelization via Sampling with Applications to Dynamic Graph Streams
"... In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams (where the input graph is defined by a sequence of edge/hyperedge insertions and deletions) and distributed systems such as MapReduce. In ..."
Abstract
 Add to MetaCart
In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams (where the input graph is defined by a sequence of edge/hyperedge insertions and deletions) and distributed systems such as Map
A GENERALIZATION OF NEMHAUSER AND TROTTER’S LOCAL OPTIMIZATION THEOREM
, 2009
"... The NemhauserTrotter local optimization theorem applies to the NPhard Vertex Cover problem and has applications in approximation as well as parameterized algorithmics. We present a framework that generalizes Nemhauser and Trotter’s result to vertex deletion and graph packing problems, introducin ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
The NemhauserTrotter local optimization theorem applies to the NPhard Vertex Cover problem and has applications in approximation as well as parameterized algorithmics. We present a framework that generalizes Nemhauser and Trotter’s result to vertex deletion and graph packing problems
Fast Dynamic Graph Algorithms for Parameterized Problems∗
"... Fully dynamic graph is a data structure that (1) supports edge insertions and deletions and (2) answers problem specific queries. The time complexity of (1) and (2) are referred to as the update time and the query time respectively. There are many researches on dynamic graphs whose update time and q ..."
Abstract
 Add to MetaCart
maintaining an approximate solution which can be used to construct a small problem kernel. Exploiting the dynamic graph for Cluster Vertex Deletion, as a corollary, we obtain a quasilineartime (polynomial) kernelization algorithm for Cluster Vertex Deletion. Until now, only quadratic time kernelization
Clustering with partial information
, 2008
"... The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of vertexdisjoint cliques, such that the editing cost is minimized. The Edge Clique Partitioning problem seeks to partition the edges of a g ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of vertexdisjoint cliques, such that the editing cost is minimized. The Edge Clique Partitioning problem seeks to partition the edges of a
Results 1  10
of
11