Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1811.09411

Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors

Laurent Bulteau·Niels Grüttemeier·Christian Komusiewicz·Manuel Sorge
View original source ↗Read source document ↗Export metadata ↓

Abstract

Given an undirected graph $G=(V,E)$ the NP-hard Strong Triadic Closure (STC) problem asks for a labeling of the edges as \emph{weak} and \emph{strong} such that at most $k$ edges are weak and for each induced $P_3$ in $G$ at least one edge is weak. In this work, we study the following generalizations of STC with $c$ different strong edge colors. In Multi-STC an induced $P_3$ may receive two strong labels as long as they are different. In Edge-List Multi-STC and Vertex-List Multi-STC we may additionally restrict the set of permitted colors for each edge of $G$. We show that, under the Exponential Time Hypothesis (ETH), Edge-List Multi-STC and Vertex-List Multi-STC cannot be solved in time $2^{o(|V|^2)}$. We then proceed with a parameterized complexity analysis in which we extend previous fixed-parameter tractability results and kernelizations for STC [Golovach et al., Algorithmica '20, Gr\"uttemeier and Komusiewicz, Algorithmica '20] to the three variants with multiple edge colors or outline the limits of such an extension.

Explore related subjects

cs.DScs.DM

Keep this discovery

BibTeXRIS

Laurent Bulteau, Niels Grüttemeier, Christian Komusiewicz, Manuel Sorge. 2018-11-23. Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors. https://arxiv.org/abs/1811.09411

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↗