Search Results - "fixed parameter algorithms"

When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices by Lokshtanov, Daniel, Ramanujan, M.S., Saurabh, Saket

“…Planarity, bipartiteness and (directed) acyclicity are basic graph properties with classic linear-time recognition algorithms. However, the problems of testing…”
Get full text

Finding a minimum spanning tree with a small non-terminal set by Hanaka, Tesshu, Kobayashi, Yasuaki

“…In this paper, we study the problem of finding a minimum weight spanning tree that contains each vertex in a given subset VNT of vertices as an internal…”
Get full text

Explainable graph clustering via expanders in the massively parallel computation model by Aghamolaei, Sepideh, Ghodsi, Mohammad

“…Explainable clustering provides human-understandable reasons for decisions in black-box learning models. In a previous work, a decision tree built on the set…”
Get full text

Fixed-parameter algorithms for graph constraint logic by Hatanaka, Tatsuhiko, Hommelsheim, Felix, Ito, Takehiro, Kobayashi, Yusuke, Mühlenthaler, Moritz, Suzuki, Akira

“…Non-deterministic constraint logic (NCL) is a simple model of computation based on orientations of a constraint graph with edge weights and vertex demands. NCL…”
Get full text

Shortest odd paths in undirected graphs with conservative weight functions by Jüttner, Alpár, Király, Csaba, Mendoza-Cadena, Lydia Mirabel, Pap, Gyula, Schlotter, Ildikó, Yamaguchi, Yutaro

“…We consider the Shortest Odd Path problem, where given an undirected graph G, a weight function on its edges, and two vertices s and t in G, the aim is to find…”
Get full text

Combinatorial n-fold integer programming and applications by Knop, Dušan, Koutecký, Martin, Mnich, Matthias

“…Many fundamental NP -hard problems can be formulated as integer linear programs (ILPs). A famous algorithm by Lenstra solves ILPs in time that is exponential…”
Get full text

High-multiplicity N-fold IP via configuration LP by Knop, Dušan, Koutecký, Martin, Levin, Asaf, Mnich, Matthias, Onn, Shmuel

“…N -fold integer programs (IPs) form an important class of block-structured IPs for which increasingly fast algorithms have recently been developed and…”
Get full text

An efficient algorithm for computing network reliability in small treewidth by Goharshady, Amir Kafshdar, Mohammadi, Fatemeh

“…•We provide an efficient parameterized algorithm that is able to compute network reliability on graphs with small treewidth in linear time.•Small-treewidth…”
Get full text

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees by 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…”
Get full text

An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems by Komusiewicz, Christian, Sorge, Manuel

“…We investigate the computational complexity of the Densestk-Subgraph problem, where the input is an undirected graph G=(V,E) and one wants to find a subgraph…”
Get full text

On the Relation of Strong Triadic Closure and Cluster Deletion by Grüttemeier, Niels, Komusiewicz, Christian

“…We study the parameterized and classical complexity of two problems that are concerned with induced paths on three vertices, called  P 3 s, in undirected…”
Get full text

A kernelization algorithm for d-Hitting Set by Abu-Khzam, Faisal N.

“…For a given parameterized problem, π, a kernelization algorithm is a polynomial-time pre-processing procedure that transforms an arbitrary instance of π into…”
Get full text

Parameterized algorithms for generalizations of Directed Feedback Vertex Set by Göke, Alexander, Marx, Dániel, Mnich, Matthias

“…The Directed Feedback Vertex Set (DFVS) problem takes as input a directed graph G and seeks a smallest vertex set S that hits all cycles in G. This is one of…”
Get full text

Almost 2-SAT is fixed-parameter tractable by Razgon, Igor, O'Sullivan, Barry

“…We consider the following problem. Given a 2- cnf formula, is it possible to remove at most k clauses so that the resulting 2- cnf formula is satisfiable? This…”
Get full text

Multivariate Algorithmics for Finding Cohesive Subnetworks by Komusiewicz, Christian

“…Community detection is an important task in the analysis of biological, social or technical networks. We survey different models of cohesive graphs, commonly…”
Get full text

A Fast Branching Algorithm for Cluster Vertex Deletion by Boral, Anudhyan, Cygan, Marek, Kociumaka, Tomasz, Pilipczuk, Marcin

“…In the family of clustering problems we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal…”
Get full text

Fixed-Parameter Algorithms for Unsplittable Flow Cover by Cristi, Andrés, Mari, Mathieu, Wiese, Andreas

“…The Unsplittable Flow Cover problem (UFP-cover) models the well-studied general caching problem and various natural resource allocation settings. We are given…”
Get full text

Monotone Arithmetic Complexity of Graph Homomorphism Polynomials by Komarath, Balagopal, Pandey, Anurag, Rahul, C. S.

“…We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph H to n -vertex graphs. These polynomials have…”
Get full text

Stable Matchings with Covering Constraints: A Complete Computational Trichotomy by Mnich, Matthias, Schlotter, Ildikó

“…Stable matching problems with lower quotas are fundamental in academic hiring and ensuring operability of rural hospitals. Only few tractable (polynomial-time…”
Get full text

Fixed-parameter algorithms for scaffold filling by Bulteau, Laurent, Carrieri, Anna Paola, Dondi, Riccardo

“…The new sequencing technologies, called next-generation sequencing, provide a huge amount of data that can be used to reconstruct genomes. However, the methods…”
Get full text