Aug 24, 2024 · We initiate a systematic study of Two-Sets Cut-Uncut within the context of parameterized complexity. By leveraging known relations between many well-studied ...
IPEC is an annual conference covering all aspects of parameterized and exact algorithms and complexity. Its 19th edition will be part of ALGO 2024.
Title: The Parameterized Complexity Landscape of Two-Sets Cut-Uncut. Matthias Bentert, Fedor V. Fomin, Fanny Hauser, Saket Saurabh. Subjects: Data Structures ...
In Two-Sets Cut-Uncut, we are given an undirected graph $G=(V,E)$ and two terminal sets $S$ and $T$. The task is to find a minimum cut $C$ in $G$ (if there ...
A fixed parameter algorithm for Mixed-Multiway Cut-Uncut using the method of recursive understanding introduced by Chitnis et al. (FOCS 2012).
This page contains a list of FPT-related papers that have appeared online, such as on the arXiv or on ECCC. They are listed in chronological order.
More generally, we show that Two-Sets Cut-Uncut is fixed-parameter tractable when parameterized by the number r of faces in a planar embedding covering the ...
Missing: Landscape | Show results with:Landscape
The rough idea of the algorithm is to first determine a large subgraph of the input graph G, such that has no small cut and only has a small interface (i.e. a ...
This problem generalizes several well-studied graph cut problems, in particular the Multicut problem, which corresponds to the case p = 2. The Multicut problem ...
Jul 3, 2019 · Recall that an undirected graph G = (V,E) is a split graph if there exists a 2-partition (V1,V2). (called a split-partition) such that G[V1] has ...
Missing: Cut- | Show results with:Cut-