„FPT algorithm“
Suchergebnisse
175 Treffer
-
PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth
-
How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks
-
An FPT Algorithm for Temporal Graph Untangling
-
Single-Exponential FPT Algorithms for Enumerating Secluded ℱ-Free Subgraphs and Deleting to Scattered Graph Classes
-
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets
-
FPT Approximation Using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
-
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width
-
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges
-
MaxCut Above Guarantee
-
Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond
-
An ??(3.82^k) Time FPT Algorithm for Convex Flip Distance
-
Domination and Cut Problems on Chordal Graphs with Bounded Leafage
-
Parameterized Approximation Algorithms for TSP
-
The Complexity of Finding Fair Many-To-One Matchings
-
Reordering a Tree According to an Order on Its Leaves
-
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
-
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs
-
Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH
-
FPT and FPT-Approximation Algorithms for Unsplittable Flow on Trees
-
An FPT Algorithm for the Embeddability of Graphs into Two-Dimensional Simplicial Complexes