Výsledky vyhľadávania - "parameterized algorithm"

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ískať plný text

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

“…In the r-Pseudoforest Deletion problem, the input is a graph G and integers k,r, and the goal is to decide whether there is a set of at most k vertices whose…”
Získať plný text

Faster Parameterized Algorithm for Cluster Vertex Deletion Autor Tsur, Dekel

“…In the Cluster Vertex Deletion problem the input is a graph G and an integer k . The goal is to decide whether there is a set of vertices S of size at most k…”
Získať plný text

A faster parameterized algorithm for temporal matching Autor Zschoche, Philipp

“…A temporal graph is a sequence of graphs (called layers) over the same vertex set—describing a graph topology which is subject to discrete changes over time. A…”
Získať 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ískať 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.•The algorithm uses branching…”
Získať plný text

An Efficient Parameterized Algorithm for Computing Quantum Channel Fidelity via Symmetries Exploitation Autor Chee, Yeow Meng, Ta, Hoang, Vu, Van Khu

“…Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information…”
Získať plný text

Subexponential Parameterized Algorithm for Minimum Fill-In Autor Fomin, Fedor V., Villanger, Yngve

“… Here, we give the first subexponential parameterized algorithm solving Minimum Fill-in in time $\mathcal{O}(2^{\mathcal{O}(\sqrt{k}\log{k})} +k^2 nm…”
Získať plný text

An improved kernel and parameterized algorithm for deletion to induced matching Autor Liu, Yuxi, Xiao, Mingyu

“… This paper studies parameterized algorithms for this problem by taking the size k of the deletion set as the parameter…”
Získať plný text

A simple and improved parameterized algorithm for bicluster editing Autor Xiao, Mingyu, Kou, Shaowei

“…•We design an effective branching rule based on the ‘brush’ structure.•We give a simple parameterized algorithm for the bicluster editing problem, which runs in O…”
Získať 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…”
Získať plný text

An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion Autor Aoike, Yuuki, Gima, Tatsuya, Hanaka, Tesshu, Kiyomi, Masashi, Kobayashi, Yasuaki, Kobayashi, Yusuke, Kurita, Kazuhiro, Otachi, Yota

“… The previously best deterministic parameterized algorithm for this problem was due to Bonnet et al. [WG 2016…”
Získať plný text

A golden ratio parameterized algorithm for Cluster Editing Autor Böcker, Sebastian

“… The problem is NP-complete, but several parameterized algorithms are known. We present a novel search tree algorithm for the problem, which improves running time from O(1.76k+m+n) to O(1.62k+m+n…”
Získať plný text

Faster parameterized algorithm for pumpkin vertex deletion set Autor Tsur, Dekel

“…A directed graph G is called a pumpkin if G is a union of induced directed paths with a common start vertex s and a common end vertex t, and the internal…”
Získať plný text

A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph Autor Ohsaka, Naoto

“…•We give an FPT algorithm for counting the number of reachable vertices in a digraph.•Our algorithm runs in truly subquadratic time if the feedback edge number…”
Získať plný text

A New Parameterized Algorithm for Rapid Peptide Sequencing Autor Song, Yinglei

“… This paper develops a new parameterized algorithm that can efficiently compute the longest antisymmetric partial path in an extended spectrum graph that is of bounded path width…”
Získať plný text

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

“…We study the multiterminal cut problem, which, given an n-vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the…”
Získať 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ískať plný text

An improved parameterized algorithm for the independent feedback vertex set problem Autor Song, Yinglei

“…In this paper, we develop a new parameterized algorithm for the Independent Feedback Vertex Set problem. Given a graph G=(V,E…”
Získať plný text

Parameterized algorithm for eternal vertex cover Autor Fomin, Fedor V., Gaspers, Serge, Golovach, Petr A., Kratsch, Dieter, Saurabh, Saket

“…In this paper we initiate the study of a “dynamic” variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhardt, from the perspective of parameterized algorithms…”
Získať plný text