Výsledky vyhledávání - parameterized algorithm

Parameterized algorithms for the Steiner arborescence problem on a hypercube: Parameterized algorithms for the Steiner arborescence Autor Mahapatra, Sugyani, Narayanan, Manikandan, Narayanaswamy, N. S.

“… As m implicitly represents Q → m comprising 2 m vertices, the running time analyses of traditional Steiner tree algorithms on general graphs does not give a clear understanding of the actual complexity of this problem…”
Získat plný text

Further parameterized algorithms for the F -free edge deletion problem Autor Gaikwad, Ajinkya, Maity, Soumen

Získat plný text

An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem Autor Chen, Jianer, Liu, Yang, Lu, Songjian

“…The parameterized node multiway cut problem is for a given graph to find a separator of size bounded by k whose removal separates a collection of terminal sets in the graph…”
Získat plný text

Parameterized algorithms and data reduction for the short secluded s‐t‐path problem Autor Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

“… s‐t‐path with at most k vertices and ℓ neighbors. We study the parameterized complexity of the problem with respect to four structural graph parameters…”
Získat plný text

An O⁎(1.84k) parameterized algorithm for the multiterminal cut problem Autor Cao, Yixin, Chen, Jianer, Fan, J.-H.

“… vertex is with a terminal or not. This bounded search tree algorithm can be shown…”
Získat plný text

Missing Link Prediction using Common Neighbor and Centrality based Parameterized Algorithm Autor Ahmad, Iftikhar, Akhtar, Muhammad Usman, Noor, Salma, Shahnaz, Ambreen

“… “Common Neighbor and Centrality based Parameterized Algorithm” (CCPA) to suggest the formation of new links in complex networks. Using AUC…”
Získat plný text

Faster parameterized algorithm for r-pseudoforest deletion Autor Tsur, Dekel

“…)-time algorithm for r-Pseudoforest Deletion for every r≥1…”
Získat plný text

Faster Parameterized Algorithm for Cluster Vertex Deletion Autor Tsur, Dekel

“… We give an algorithm for Cluster Vertex Deletion whose running time is O ∗ (1.811 k )…”
Získat plný text

Parameterized algorithms for min–max 2-cluster editing Autor Chen, Li-Hsuan, Wu, Bang Ye

“… In this paper, we design parameterized algorithms for different ranges of t . Let k = t - n / 4 . We show that the problem is polynomial-time solvable when roughly k…”
Získat plný text

Parameterized algorithms for locating-dominating sets Autor Cappelle, Márcia R., Gomes, Guilherme C.M, Santos, Vinicius F. dos

“… The latter naturally leads to questions on the parameterized complexity of the problem. While some have already been answered, in this work…”
Získat plný text

An O ∗ ( 3.5 3 3 k ) -time parameterized algorithm for the 3-set packing problem Autor Wang, Jianxin, Feng, Qilong, Chen, Jianer

“…A parameterized algorithm for the well-known NP-complete problem 3- set packing is presented…”
Získat plný text

Parameterized Algorithms for Queue Layouts Autor Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin

“… of $G$. We present two fixed-parameter tractable algorithms that exploit structural properties of graphs to compute optimal queue layouts…”
Získat plný text

Parameterized algorithms for minimum sum vertex cover Autor Aute, Shubhada, Panolan, Fahad

“… than 1.014 for MSVC is NP-hard, assuming the Unique Games Conjecture. We study the MSVC problem from the perspective of parameterized algorithms…”
Získat plný text

A faster parameterized algorithm for temporal matching Autor Zschoche, Philipp

“…′ do not share an endpoint, or the time-labels t and t′ are at least Δ time units apart. Mertzios et al. [STACS '20] provided a 2O(Δν)⋅|G|O(1)-time algorithm to compute the maximum size…”
Získat plný text

A parameterized algorithm for subset feedback vertex set in tournaments Autor Bai, Tian, Xiao, Mingyu

“… When T=V, SFVS degenerates to the classical Feedback Vertex Set problem (FVS). Both SFVS and FVS have been extensively studied in parameterized algorithms…”
Získat plný text

Parameterized Algorithms for Book Embedding Problems Autor Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin

“…}}$ are fixed-parameter tractable parameterized by the vertex cover number of the graph and that ${\rm F{\small IXED}-O{\small RDER}~B{\small OOK}~T{\small HICKNESS}}$ is fixed-parameter tractable parameterized by the pathwidth of the vertex order…”
Získat plný text

Simple and Improved Parameterized Algorithms for Multiterminal Cuts Autor Xiao, Mingyu

“… ≥3 but well-known to be polynomial-time solvable for k =2 by the flow technique. In this paper, based on a notion farthest minimum isolating cut , we design several simple and improved algorithms for Multiterminal Cut…”
Získat plný text

Parameterized algorithms for d - Hitting Set: The weighted case Autor Fernau, Henning

“…We are going to analyze search tree algorithms for Weighted d - Hitting Set. Although the algorithms that we develop are fairly simple, their analysis is technically involved…”
Získat plný text

Faster parameterized algorithm for Bicluster Editing Autor Tsur, Dekel

“…•We give an O⁎(2.636k)-time algorithm for Bicluster Editing.•Our algorithm is faster than previous algorithms for this problem…”
Získat plný text

Faster approximation schemes and parameterized algorithms on (odd-) H -minor-free graphs Autor Tazari, Siamak

“…]. We use these algorithms to derive faster 2-approximations; furthermore, we present the first PTASes and subexponential FPT-algorithms for independent set and vertex cover on these graph classes using a novel dynamic programming technique…”
Získat plný text