Suchergebnisse - "Fixed-parameter algorithm"

A fixed-parameter algorithm for dominance drawings of DAGs von Ortali, Giacomo, Tollis, Ioannis G.

“… A weak dominance drawing Γ of a DAG G=(V,E) is a d-dimensional drawing such that D(u)<D(v) for every dimension D of Γ if there is a directed path from a vertex …”
Volltext

An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion von Abu-Khzam, Faisal N., Makarem, Norma, Shehab, Maryam

“… A simple fixed-parameter algorithm solves the problem in O⁎(3k), and a decade-old algorithm improved this running to O⁎(2.74k …”
Volltext

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees von van Iersel, Leo, Janssen, Remie, Jones, Mark, Murakami, Yukihiro, Zeh, Norbert

“… We present the first fixed-parameter algorithm for constructing a tree-child phylogenetic network that displays an arbitrary number of binary input trees and has the minimum number of reticulations …”
Volltext

A fixed-parameter algorithm for the vertex cover P 3 problem von Tu, Jianhua

Volltext

A fixed-parameter algorithm for the vertex cover P3 problem von Tu, Jianhua

“… The VCPt problem is NP-hard for any integer t≥2. In this paper, we restrict our attention to the VCP3 problem and present a fixed-parameter algorithm with runtime O(2kk3.376+n4m …”
Volltext

Improved Fixed-Parameter Algorithm for the Tree Containment Problem on Unrooted Phylogenetic Network von Shi, Feng, Li, Hangcheng, Rong, Guozhen, Zhang, Zhen, Wang, Jianxin

“… Phylogenetic trees are unable to represent the evolutionary process for a collection of species if reticulation events happened, and a generalized model named …”
Volltext

A fixed-parameter algorithm for guarding 1.5D terrains von Khodakarami, Farnoosh, Didehvar, Farzad, Mohades, Ali

“… A 1.5D terrain is a region on a plane determined by an x-monotone polygonal chain. A set G of points on the terrain is called a guarding set if every point on …”
Volltext

A faster fixed parameter algorithm for two-layer crossing minimization von Kobayashi, Yasuaki, Tamaki, Hisao

“… •We improve the running time of the previously known fixed parameter algorithm …”
Volltext

A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors von Kordon, Alix Munier, Tang, Ning

“… The parameter considered is the pathwidth of the associated interval graph. A fixed-parameter algorithm based on a dynamic programming approach is developed to solve this optimization problem …”
Volltext

A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization von Kobayashi, Yasuaki, Tamaki, Hisao

“… We give a subexponential fixed parameter algorithm for one-sided crossing minimization …”
Volltext

A fixed-parameter algorithm for the maximum agreement forest problem on multifurcating trees von Shi, Feng, Wang, Jianxin, Yang, Yufei, Feng, Qilong, Li, Weilong, Chen, Jianer

“… The Maximum Agreement Forest （MAF） problem on two given phylogenetic trees is an important NP-hard problem in the field of computational biology. In this …”
Volltext

A fixed-parameter algorithm for the vertex cover P^sub 3^ problem von Tu, Jianhua

“… problem is NP-hard for any integer t≥2. This paper restricts its attention to the VCP... problem and present a fixed-parameter algorithm with runtime O(2...k...+n...m) for the VCP... problem …”
Volltext

A fixed-parameter algorithm for the vertex cover P sub(3)P3 problem von Tu, Jianhua

“… In this paper, we restrict our attention to the VCP sub(3)VCP3 problem and present a fixed-parameter algorithm with runtime O(2 super(k)k super(3.376)+n super(4)m)O(2kk3.376+n4m) for the VCP sub(3)VCP3 problem …”
Volltext

Orientable burning number of graphs von Courtiel, Julien, Dorbec, Paul, Gima, Tatsuya, Lecoq, Romain, Otachi, Yota

“… In this paper, we introduce the problem of finding an orientation of a given undirected graph that maximizes the burning number of the resulting directed …”
Volltext

Parameterized algorithms for the spanning forest isomorphism and containment on tree von Liu, Jingyi, Chen, Xian, Zheng, Yicheng, Wang, Jianxin, Shi, Feng

“… •FPT algorithms for the Spanning Forest Isomorphism on Tree problem.•FPT algorithms for the Spanning Forest Containment on Tree problem.•Polynomial-time …”
Volltext

Cutwidth I: A linear time fixed parameter algorithm von Thilikos, Dimitrios M., Serna, Maria, Bodlaender, Hans L.

“… The cutwidth of a graph G is the smallest integer k such that the vertices of G can be arranged in a linear layout [ v 1 , … , v n ] in such a way that, for …”
Volltext

Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane von Cambazard, Hadrien, Catusse, Nicolas

“… •A fixed-parameter algorithm for the rectilinear travelling salesman problem.•A fixed-parameter algorithm for the rectilinear Steiner tree problem …”
Volltext

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs von Giannopoulou, Archontia C., Mertzios, George B., Niedermeier, Rolf

“… We study the design of fixed-parameter algorithms for problems already known to be solvable in polynomial time …”
Volltext

Faster deterministic Feedback Vertex Set von Kociumaka, Tomasz, Pilipczuk, Marcin

“… We present a new deterministic algorithm for the Feedback Vertex Set problem parameterized by the solution size. Our algorithm runs in O⁎((2+ϕ)k) time, where …”
Volltext

Charge and reduce: A fixed-parameter algorithm for String-to-String Correction von Abu-Khzam, Faisal N., Fernau, Henning, Langston, Michael A., Lee-Cultura, Serena, Stege, Ulrike

“… We prove that String-to-String Correction is fixed-parameter tractable, for parameter k , and present a simple fixed-parameter algorithm that solves the problem in O ( 2 k n ) time …”
Volltext