„FPT Algorithm“

Suchergebnisse

175 Treffer

• Colored Hypergraph Isomorphism is Fixed Parameter Tractable
  Arvind, V. ; Das, Bireswar ; Köbler, Johannes ; Toda, Seinosuke 2010 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation
  Manurangsi, Pasin 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An FPT Algorithm for Directed Co-Graph Edge Deletion
  Li, Wenjun ; Yang, Xueying ; Xu, Chao ; Yang, Yongjie 2024 Saarländische Universitäts- und Landesbibliothek
• Parameterized Algorithms
  2015 Springer International Publishing
• Anti-factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
  Marx, Dániel ; Sankar, Govind S. ; Schepper, Philipp
• Improved FPT Algorithms for Deletion to Forest-Like Structures
  Gowda, Kishen N. ; Lonkar, Aditya ; Panolan, Fahad ; Patel, Vraj ; Saurabh, Saket
• FPT algorithms for a special block-structured integer program with applications in scheduling
  Chen, Hua ; Chen, Lin ; Zhang, Guochuan
• Domination and cut problems on chordal graphs with bounded leafage
  Galby, Esther ; Marx, Dániel ; Schepper, Philipp ; Sharma, Roohani ; Tale, Prafullkumar 2023 Technische Universität Hamburg. Universitätsbibliothek
• An $$\mathcal {O}(3.82^{k})$$ O ( 3 . 82 k ) Time $$\textsf {FPT}$$ FPT Algorithm for Convex Flip Distance
  Li, Haohong ; Xia, Ge
• Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
  Gomes, Guilherme C. M. ; Guedes, Matheus R. ; Santos, Vinicius F. dos
• Domination and cut problems on chordal graphs with bounded leafage
  Galby, Esther ; Marx, Dániel ; Schepper, Philipp ; Sharma, Roohani ; Tale, Prafullkumar 2022 Universitätsbibliothek der Technischen Universität Hamburg
• Strongly Polynomial FPTASes for Monotone Dynamic Programs
  Alon, Tzvi ; Halman, Nir
• Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics
  Marchand, Bertrand ; Ponty, Yann ; Bulteau, Laurent
• New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees
  Borst, Sander ; van Iersel, Leo ; Jones, Mark ; Kelk, Steven
• An FPT Algorithm for Directed Spanning k-Leaf
  Bonsma, Paul ; Dorn, Frederic
• FPT-Algorithm for Computing the Width of a Simplex Given by a Convex Hull
  Veselov, S. I. ; Gribanov, D. V. ; Malyshev, D. S.
• Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
  Gomes, Guilherme C. M. ; Sau, Ignasi
• An Improved FPT Algorithm for Independent Feedback Vertex Set
  Li, Shaohua ; Pilipczuk, Marcin
• FPT algorithms for diverse collections of hitting sets
  Baste, Julien ; Jaffke, Lars ; Masařík, Tomáš ; Philip, Geevarghese ; Rote, Günter 2019 Universität Ulm
• A constant FPT approximation algorithm for hard-capacitated k-means
  Xu, Yicheng ; Möhring, Rolf H. ; Xu, Dachuan ; Zhang, Yong ; Zou, Yifei