Results 41 to 50 of about 42,360 (298)

Co-Clustering under the Maximum Norm

Algorithms, 2016
Co-clustering, that is partitioning a numerical matrix into “homogeneous” submatrices, has many applications ranging from bioinformatics to election analysis. Many interesting variants of co-clustering are NP-hard.
Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier   +3 more
doaj   +1 more source

The Parameterized Complexity of the Rainbow Subgraph Problem

Algorithms, 2015
The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices.
Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Martin Rötzschke   +3 more
doaj   +1 more source

Structure of conflict graphs in constraint alignment problems and algorithms [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
We consider the constrained graph alignment problem which has applications in biological network analysis. Given two input graphs $G_1=(V_1,E_1), G_2=(V_2,E_2)$, a pair of vertex mappings induces an {\it edge conservation} if the vertex pairs are ...
Ferhat Alkan, Türker Bıyıkoğlu, Marc Demange, Cesim Erten   +3 more
doaj   +1 more source

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem [PDF]

Discrete Mathematics & Theoretical Computer Science
In this work, we study the Biclique-Free Vertex Deletion problem: Given a graph $G$ and integers $k$ and $i \le j$, find a set of at most $k$ vertices that intersects every (not necessarily induced) biclique $K_{i, j}$ in $G$.
Lito Goldmann, Leon Kellerhals, Tomohiro Koana   +2 more
doaj   +1 more source

Fixed-parameter tractability of multicut parameterized by the size of the cutset [PDF]

, 2013
Given an undirected graph $G$, a collection $\{(s_1,t_1),..., (s_k,t_k)\}$ of pairs of vertices, and an integer $p$, the Edge Multicut problem ask if there is a set $S$ of at most $p$ edges such that the removal of $S$ disconnects every $s_i$ from the ...
Bousquet N., Bousquet N., Chen J., Chitnis R., Chitnis R., Dániel Marx, Gupta A., Igor Razgon, Khot S., Kratsch S., Lokshtanov D., Marx D., Marx D., Naor M., Pichler R., Raman V., Sherman J., Xiao M., Yannakakis M.   +18 more
core   +2 more sources

Chordal Deletion is Fixed-Parameter Tractable [PDF]

Algorithmica, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Parameterized Complexity Dichotomy for Steiner Multicut [PDF]

, 2014
The Steiner Multicut problem asks, given an undirected graph G, terminals sets T1,...,Tt $\subseteq$ V(G) of size at most p, and an integer k, whether there is a set S of at most k edges or nodes s.t.
Bringmann, Karl, Hermelin, Danny, Mnich, Matthias, van Leeuwen, Erik Jan   +3 more
core   +8 more sources

Special Issue on Graph Algorithms

Algorithms, 2013
This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
Jesper Jansson
doaj   +1 more source

Optimal Discretization is Fixed-parameter Tractable [PDF]

, 2021
Given two disjoint sets $W_1$ and $W_2$ of points in the plane, the Optimal Discretization problem asks for the minimum size of a family of horizontal and vertical lines that separate $W_1$ from $W_2$, that is, in every region into which the lines partition the plane there are either only points of $W_1$, or only points of $W_2$, or the region is empty.
Kratsch, Stefan, Masařík, Tomáš, Muzi, Irene, Pilipczuk, Marcin, Sorge, Manuel   +4 more
openaire   +2 more sources

Quantified Conjunctive Queries on Partially Ordered Sets [PDF]

, 2014
We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed graph).
Bova, Simone, Ganian, Robert, Szeider, Stefan   +2 more
core   +1 more source