Sep 15, 2020 · In this work, we study Module Map, a generalization of Cluster Editing in graphs with two types of edges. Module maps. The Module Map problem ...

Abstract. We introduce and study the NP-hard Module Map problem which has as input a graph G with red and blue edges and asks to.

Sep 15, 2020 · In Section 4, we present an improved (in terms of the exponential running-time part) fixed-parameter algorithm for Weighted Module Map with ...

Jul 18, 2018 · We show that Module Map can be solved in time on n-vertex graphs and present a problem kernelization with vertices.

The NP-hard Module Map problem is introduced and it is shown that Module Map can be solved in \(\mathcal {O}(2^k \cdot n^3)\) time on n-vertex graphs and a ...

We show that Module Map can be solved in O ( 2 k ⋅ n 3 ) time on n-vertex graphs and present a problem kernelization with O ( k 2 ) vertices.

Jan 21, 2020 · Abstract. Motivated by applications in the analysis of genetic networks, we introduce and study the NP-hard Module Map problem which has as ...

We show that Module Map can be solved in O(3k⋅(|V|+|E|)) O ( 3 k ⋅ ( | V | + | E | ) ) time and O(2k⋅|V|3) O ( 2 k ⋅ | V | 3 ) time, respectively.

Feb 18, 2020 · Motivated by applications in the analysis of genetic networks, we introduce and study the NP-hard Module Map problem which has as input a ...

We introduce and study the NP-hard Module Map problem which has as input a graph G with red and blue edges and asks to transform G by at most k edge ...