Results 31 to 40 of about 2,616,817 (282)
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
Journal of Graph Algorithms and Applications, 2021 Editing a graph into a disjoint union of clusters is a standard optimization task in graph-based data clustering. Here, complementing classical work where the clusters shall be cliques, we focus on clusters that shall be 2-clubs, that is, subgraphs of ...
Aleksander Figiel +3 more
doaj +1 more source
Spanning Trees Minimizing Branching Costs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$.
Luisa Gargano, Adele A. Rescigno
doaj +1 more source
Experiments with the Fixed-Parameter Approach for Two-Layer Planarization
Journal of Graph Algorithms and Applications, 2005 We present computational results of an implementation based on the fixed parameter tractability (FPT) approach for biplanarizing graphs. These results show that the implementation can efficiently find minimum biplanarizing sets containing up to about 18 ...
Matthew Suderman, Sue Whitesides
doaj +1 more source
Balanced Judicious Bipartition is Fixed-Parameter Tractable [PDF]
SIAM Journal on Discrete Mathematics, 2019 The family of judicious partitioning problems, introduced by Bollobás and Scott to the field of extremal combinatorics, has been extensively studied from a structural point of view for over two decades. This rich realm of problems aims to counterbalance the objectives of classical partitioning problems such as Min Cut, Min Bisection and Max Cut.
Daniel Lokshtanov +3 more
openaire +8 more sources
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 +3 more
doaj +1 more source
Reconciling multiple genes trees via segmental duplications and losses
Algorithms for Molecular Biology, 2019 Reconciling gene trees with a species tree is a fundamental problem to understand the evolution of gene families. Many existing approaches reconcile each gene tree independently.
Riccardo Dondi +2 more
doaj +1 more source
Fixed-Parameter tractability results for Full-Degree Spanning Tree and its dual [PDF]
, 2006 We provide first-time fixed-parameter tractability results ...
Rolf Niedermeier +2 more
core +1 more source
The Fixed-Parameter Tractability of Model Checking Concurrent Systems [PDF]
, 2013 We study the fixed-parameter complexity of model checking temporal logics on concurrent systems that are modeled as the product of finite systems and where the size of the formula is the parameter.
Göller, Stefan
core +1 more source
Train Marshalling Is Fixed Parameter Tractable [PDF]
, 2012 The train marshalling problem is about reordering the cars of a train using as few auxiliary rails as possible. The problem is known to be NP-complete. We show that it is fixed parameter tractable (FPT) with the number of auxiliary rails as parameter.
Leo Brueggeman +7 more
openaire +2 more sources
: Fixed-parameter Tractability Above A Higher Guarantee [PDF]
, 2015 We investigate the following above-guarantee parameterization of the classical Vertex Cover problem: Given a graph $G$ and $k\in\mathbb{N}$ as input, does $G$ have a vertex cover of size at most $(2LP-MM)+k$?
Philip, G. +3 more
core +1 more source