Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2410.06337

Faster Algorithms for Graph Monopolarity

Geevarghese Philip·Shrinidhi Teganahally Sridhara
View original source ↗Read source document ↗Export metadata ↓

Abstract

A graph $G = (V,E)$ is $\textit{monopolar}$ if its vertex set admits a partition $V = (C \uplus{} I)$ where $G[C]$ is a $\textit{cluster graph}$ and $I$ is an $\textit{independent set}$ in $G$; this is a \textit{monopolar partition} of $G$. The MONOPOLAR RECOGNITION problem -- deciding whether an input graph is monopolar -- is known to be NP-Hard in very restricted graph classes such as sub-cubic planar graphs. We derive a polynomial-time algorithm that takes (i) a graph $G=(V,E)$ and (ii) a vertex modulator $S$ of $G$ to chair-free graphs as inputs, and checks whether $G$ has a monopolar partition $V=(C\uplus{}I)$ where set $S$ is contained in the cluster part. We build on this algorithm to develop fast exact exponential-time and parameterized algorithms for MONOPOLAR RECOGNITION. Our exact algorithm solves MONOPOLAR RECOGNITION in $\mathcal{O}^{\star}(1.3734^{n})$ time on input graphs with $n$ vertices, where the $\mathcal{O}^{\star}()$ notation hides polynomial factors. In fact, we solve the more general problems MONOPOLAR EXTENSTION and LIST-MONOPOLAR PARTITION in $\mathcal{O}^{\star}(1.3734^{n})$ time. These are the first improvements over the trivial $\mathcal{O}^{\star}(2^{n})$-time algorithms for all these problems. It is known that -- assuming ETH -- these problems cannot be solved in $\mathcal{O}^{\star}(2^{o(n)})$ time. Our FPT algorithms solve MONOPOLAR RECOGNITION in $\mathcal{O}^{\star}(3.076^{k_{v}})$ and $\mathcal{O}^{\star}(2.253^{k_{e}})$ time where $k_{v}$ and $k_{e}$ are, respectively, the sizes of the smallest vertex and edge modulators of the input graph to claw-free graphs. These results are a significant addition to the small number of FPT algorithms currently known for MONOPOLAR RECOGNITION.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Geevarghese Philip, Shrinidhi Teganahally Sridhara. 2024-10-08. Faster Algorithms for Graph Monopolarity. https://arxiv.org/abs/2410.06337

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

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↗