Results 31 to 40 of about 42,360 (298)
Interval Completion Is Fixed Parameter Tractable [PDF]
SIAM Journal on Computing, 2009 We present an algorithm with runtime $O(k^{2k}n^3m)$ for the following NP-complete problem: Given an arbitrary graph $G$ on $n$ vertices and $m$ edges, can we obtain an interval graph by adding at most $k$ new edges to $G$? This resolves the long-standing open question, first posed by Kaplan, Shamir and Tarjan, of whether this problem could be solved ...
Villanger, Yngve +3 more
openaire +2 more sources
Jungles, bundles, and fixed-parameter tractability [PDF]
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013 The new version contains simplified proofs providing better running times of the algorithms, as well as a wider discussion of the ...
Fedor V. Fomin, Michal Pilipczuk
openaire +2 more sources
Chordal Editing is Fixed-Parameter Tractable [PDF]
Algorithmica, 2015 Graph modification problems are typically asked as follows: is there a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property, one can define significantly different versions by allowing different ...
Cao, Yixin, Marx, Dániel
openaire +5 more sources
Fixed-parameter tractable algorithms for Tracking Shortest Paths [PDF]
Theoretical Computer Science, 2020 We consider the parameterized complexity of the problem of tracking shortest s-t paths in graphs, motivated by applications in security and wireless networks. Given an undirected and unweighted graph with a source s and a destination t, Tracking Shortest Paths asks if there exists a k-sized subset of vertices (referred to as tracking set) that ...
Aritra Banik +3 more
openalex +5 more sources
Practical Access to Dynamic Programming on Tree Decompositions
Algorithms, 2019 Parameterized complexity theory has led to a wide range of algorithmic breakthroughs within the last few decades, but the practicability of these methods for real-world problems is still not well understood.
Max Bannach, Sebastian Berndt
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. While
Lokshtanov, Daniel +3 more
openaire +6 more sources
Vertex Cover Reconfiguration and Beyond
Algorithms, 2018 In the Vertex Cover Reconfiguration (VCR) problem, given a graph G, positive integers k and ℓ and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most ℓ vertex additions or removals ...
Amer E. Mouawad +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
EURASIP Journal on Wireless Communications and Networking, 2021 The energy cost minimization for mission-critical internet-of-things (IoT) in mobile edge computing (MEC) system is investigated in this work. Therein, short data packets are transmitted between the IoT devices and the access points (APs) to reduce ...
Yaru Fu +6 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