Computing Subset Feedback Vertex Set via Leafage

Charis Papadopoulos; Spyridon Tzimas

Home/Archive/arXiv

arXiv · 2103.03035

Computing Subset Feedback Vertex Set via Leafage

Charis Papadopoulos·Spyridon Tzimas

View original source ↗Read source document ↗Export metadata ↓

Abstract

A typical example that behaves computationally different in subclasses of chordal graphs is the \textsc{Subset Feedback Vertex Set} (SFVS) problem: given a vertex-weighted graph $G=(V,E)$ and a set $S\subseteq V$, the \textsc{Subset Feedback Vertex Set} (SFVS) problem asks for a vertex set of minimum weight that intersects all cycles containing a vertex of $S$. SFVS is known to be polynomial-time solvable on interval graphs, whereas SFVS remains \NP-complete on split graphs and, consequently, on chordal graphs. Towards a better understanding of the complexity of SFVS on subclasses of chordal graphs, we exploit structural properties of a tree model in order to cope with the hardness of SFVS. Here we consider variants of the \emph{leafage} that measures the minimum number of leaves in a tree model. We show that SFVS can be solved in polynomial time for every chordal graph with bounded leafage. In particular, given a chordal graph on $n$ vertices with leafage $\ell$, we provide an algorithm for SFVS with running time $n^{O(\ell)}$. We complement our result by showing that SFVS is \W[1]-hard parameterized by $\ell$. Pushing further our positive result, it is natural to consider a slight generalization of leafage, the \emph{vertex leafage}, which measures the smallest number among the maximum number of leaves of all subtrees in a tree model. However, we show that it is unlikely to obtain a similar result, as we prove that SFVS remains \NP-complete on undirected path graphs, i.e., graphs having vertex leafage at most two. Moreover, we strengthen previously-known polynomial-time algorithm for SFVS on rooted path graphs that form a proper subclass of undirected path graphs and graphs of mim-width one.

Explore related subjects

cs.DS

Keep this discovery

BibTeX RIS

Charis Papadopoulos, Spyridon Tzimas. 2021-03-04. Computing Subset Feedback Vertex Set via Leafage. https://arxiv.org/abs/2103.03035

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗