Results 261 to 270 of about 2,616,817 (282)
Some of the next articles are maybe not open access.
Fixed-Parameter Tractable Generalizations of Cluster Editing
2006In the Cluster Editing problem, a graph has to be changed to a disjoint union of cliques by at most k edge insertions or deletions. Several reasons suggest a generalized problem where the target graph can have some overlapping cliques. We show that the problem remains fixed-parameter tractable (FPT) in the combination of both parameters: k and a second
openaire +2 more sources
Sparse Integer Programming Is Fixed-Parameter Tractable
Mathematics of Operations ResearchWe study the general integer programming problem where the number of variables n is a variable part of the input. We consider two natural parameters of the constraint matrix A: its numeric measure a and its sparsity measure d. We present an algorithm for solving integer programming in time [Formula: see text], where g is some computable function of ...
Friedrich Eisenbrand +5 more
openaire +3 more sources
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability
Theoretical Computer Science, 2021Tesshu Hanaka +2 more
exaly
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters, 1996Leizhen Cai
exaly
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms, 2011Günter Rote +2 more
exaly
Minimizing Movement: Fixed-Parameter Tractability
ACM Transactions on Algorithms, 2014Dániel Marx +2 more
exaly
Bounded fixed-parameter tractability and nondeterministic bits
Journal of Computer and System Sciences, 2006Martin Grohe, Jörg Flum
exaly
Fixed-parameter tractability and data reduction for multicut in trees
Networks, 2005Rolf Niedermeier, Jiong Guo
exaly
Fixed-parameter tractability and lower bounds for stabbing problems
Computational Geometry: Theory and Applications, 2013Günter Rote +2 more
exaly