Search Results - "parameterized algorithm"

Parameterized complexity of categorical clustering with size constraints by Fomin, Fedor V., Golovach, Petr A., Purohit, Nidhi

“…In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a1,…,an} over Σm, where Σ is a finite alphabet, and integers k and B. The task…”
Get full text

Algorithms for comparing large pedigree graphs by Belal, Nahla A., Amar, Lamiaa A., Sherief, Hany H.

“…The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing…”
Get full text

Fixed parameterized algorithms for generalized feedback vertex set problems by Sheng, Bin, Gutin, Gregory

“…A graph is an r-pseudoforest if every connected component of it has a feedback edge set of size at most r. A graph is a d-quasi-forest if every connected…”
Get full text

On the complexity of the Cable-Trench Problem by Benedito, Marcelo P.L., Pedrosa, Lehilton L.C., Rosado, Hugo K.K.

“…The Cable-Trench Problem (CTP) is a common generalization of the Single-Source Shortest Paths Problem (SSSP) and the Minimum Spanning Tree Problem (MST): given…”
Get full text

Vertex partitioning problems on graphs with bounded tree width by Aravind, N.R., Kalyanasundaram, Subrahmanyam, Kare, Anjeneya Swami

“…In an undirected graph, a matching cut is a partition of vertices into two sets such that the edges across the sets induce a matching. The Matching Cut problem…”
Get full text

Improved upper bounds for vertex cover by Chen, Jianer, Kanj, Iyad A., Xia, Ge

“…This paper presents an O ( 1.273 8 k + k n ) -time polynomial-space algorithm for Vertex Cover improving the previous O ( 1.28 6 k + k n ) -time…”
Get full text

Colouring a dominating set without conflicts: q-Subset Square Colouring by Abidha, V.P., Ashok, Pradeesha, Tomar, Avi, Yadav, Dolly

“…The Square Colouring of a graph G refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive…”
Get full text

On the complexity of and solutions to the minimum stopping and trapping set problems by Velasquez, Alvaro, Subramani, K., Wojciechowski, Piotr

“…In this paper, we discuss the problems of finding minimum stopping sets and trapping sets in Tanner graphs, using integer linear programming. These problems…”
Get full text

Faster Exact and Approximate Algorithms for k-Cut by Gupta, Anupam, Lee, Euiwoong, Li, Jason

“…In the k-cut problem, we are given an edge-weighted graph G and an integer k, and have to remove a set of edges with minimum total weight so that G has at…”
Get full text

Long directed (s,t)-path: FPT algorithm by Fomin, Fedor V., Lokshtanov, Daniel, Panolan, Fahad, Saurabh, Saket, Zehavi, Meirav

“…Given a digraph G, two vertices s,t∈V(G) and a non-negative integer k, the Long Directed(s,t)-Path problem asks whether G has a path of length at least k from…”
Get full text

Deterministic parameterized algorithms for the Graph Motif problem by Pinter, Ron Y., Shachnai, Hadas, Zehavi, Meirav

“…We study the classic Graph Motif problem. Given a graph G=(V,E) with a set of colors for each node, and a multiset M of colors, we seek a subtree T⊆G, and a…”
Get full text

Representative families: A unified tradeoff-based approach by Shachnai, Hadas, Zehavi, Meirav

“…Given a matroid M=(E,I), and a family S of p-subsets of E, a subfamily Sˆ⊆S represents S if for any X∈S and Y⊆E∖X satisfying X∪Y∈I, there is a set Xˆ∈Sˆ…”
Get full text

A multivariate framework for weighted FPT algorithms by Shachnai, Hadas, Zehavi, Meirav

“…We introduce a multivariate approach for solving weighted parameterized problems. By allowing flexible use of parameters, our approach defines a framework for…”
Get full text

Dealing with 4-variables by resolution: An improved MaxSAT algorithm by Chen, Jianer, Xu, Chao, Wang, Jianxin

“…We study techniques for solving the Maximum Satisfiability problem (MaxSAT). Our focus is on variables of degree 4. We identify cases for degree-4 variables…”
Get full text

New Frontiers in Parameterized Complexity and Algorithms

“…The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new…”
Get full text

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

“…The Cluster Editing problem asks to transform a graph by at most k edge modifications into a disjoint union of cliques. The problem is NP-complete, but several…”
Get full text

A Polynomial Kernel for Funnel Arc Deletion Set by Garlet Milani, Marcelo

“…In Directed Feedback Arc Set ( DFAS ) we search for a set of at most k arcs which intersect every cycle in the input digraph. It is a well-known open problem…”
Get full text

The label cut problem with respect to path length and label frequency by Zhang, Peng, Fu, Bin

“…Given a graph with labels defined on edges and a source-sink pair (s,t), the Labels-tCut problem asks for a minimum number of labels such that the removal of…”
Get full text

Matching and Weighted P2-Packing: Algorithms and Kernels by Feng, Qilong, Wang, Jianxin, Chen, Jianer

“…Parameterized algorithms and kernelization algorithms are presented for the weighted P2-Packing problem, which is a generalization of the famous Graph Matching…”
Get full text

On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width by Ganian, Robert, Hliněný, Petr

“…Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal…”
Get full text