NP-hard problems in hierarchical-tree clustering
Acta Informatica
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM (JACM)
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
Theory of Computing Systems
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization
ACM SIGACT News
Applying Modular Decomposition to Parameterized Cluster Editing Problems
Theory of Computing Systems
A more effective linear kernelization for cluster editing
Theoretical Computer Science
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Kernelization: New Upper and Lower Bound Techniques
Parameterized and Exact Computation
Fixed-Parameter Algorithms for Cluster Vertex Deletion
Theory of Computing Systems - Special Section: Algorithmic Game Theory; Guest Editors: Burkhard Monien and Ulf-Peter Schroeder
Alternative parameterizations for cluster editing
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Even faster parameterized cluster deletion and cluster editing
Information Processing Letters
A 2k kernel for the cluster editing problem
Journal of Computer and System Sciences
A golden ratio parameterized algorithm for cluster editing
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Efficient parameterized preprocessing for cluster editing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
Partitioning into colorful components by minimum edge deletions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Hi-index | 0.00 |
We present a first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to make a given digraph transitive by a minimum number of arc insertions or deletions. Transitivity Editing has applications in the detection of hierarchical structure in molecular characteristics of diseases. We demonstrate that if the input digraph does not contain ''diamonds'', then there is an optimal solution that performs only arc deletions. This fact helps us construct a first proof of NP-hardness, which also extends to the restricted cases in which the input digraph is acyclic or has maximum degree three. By providing an O(k^2)-vertex problem kernel, we answer an open question from the literature. In case of digraphs with maximum degree d, an O(k@?d)-vertex problem kernel can be shown. Moreover, we improve previous fixed-parameter algorithms, now achieving a running time of O(2.57^k+n^3) for an n-vertex digraph if k arc modifications are sufficient to make it transitive. Our hardness as well as algorithmic results transfer to Transitivity Deletion, where only arc deletions are allowed.