跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2604.22584 · v3

Increasing arc-connectivity by bounded- and fixed-size inversions

首次提交 2026-04-24 22:16
版本更新 2026-11-18 10:29
雷达观测 2026-11-19 19:08
arXiv ↗PDF ↗

摘要

For a digraph DD and some X⊆V(D)X \subseteq V(D), the inversion of XX is the operation of flipping all arcs both of whose endvertices are in XX. We initiate the study of establishing arc-connectivity properties by applying inversions of bounded or fixed size. For fixed-size inversions, the feasibility problem is interesting. For all integers p≥2p \geq 2 and k≥1k \geq 1, we give a characterization of the digraphs that can be made kk-arc-strong by applying inversions of size exactly pp, provided they are sufficiently large. For bounded-size inversions, the feasibility problem is easy, so we focus on minimising the number of inversions. We prove that for all integers p≥3p\geq 3 and k≥1k \geq 1 and any ε>0ε>0, there exists a polynomial-time (4k−2+ε)(4k-2+ε)-approximation algorithm for computing the minimum number of inversions of size at most pp that make a given digraph kk-arc-strong. This is in stark contrast to other results on inversion optimization problems. On the other hand, we show that for any p≥3p\geq 3 and k≥1k \geq 1 the problem is NP-hard, and, moreover, APX-hard. As a result on parameterized complexity, we show that for any k≥2k \geq 2, it is W[1]W[1]-hard with respect to pp to decide whether a given digraph can be made kk-arc-strong by applying a single inversion of size at most pp. We also prove that for a given multidigraph, it is W[1]W[1]-hard with respect to ℓ\ell to decide whether it can be made 2-arc-strong by applying ℓ\ell inversions of size 2.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-18 10:29 · 最新观测版本

Increasing arc-connectivity by bounded- and fixed-size inversions

For a digraph DD and some X⊆V(D)X \subseteq V(D), the inversion of XX is the operation of flipping all arcs both of whose endvertices are in XX. We initiate the study of establishing arc-connectivity properties by applying inversions of bounded or fixed size. For fixed-size inversions, the feasibility problem is interesting. For all integers p≥2p \geq 2 and k≥1k \geq 1, we give a characterization of the digraphs that can be made kk-arc-strong by applying inversions of size exactly pp, provided they are sufficiently large. For bounded-size inversions, the feasibility problem is easy, so we focus on minimising the number of inversions. We prove that for all integers p≥3p\geq 3 and k≥1k \geq 1 and any ε>0ε>0, there exists a polynomial-time (4k−2+ε)(4k-2+ε)-approximation algorithm for computing the minimum number of inversions of size at most pp that make a given digraph kk-arc-strong. This is in stark contrast to other results on inversion optimization problems. On the other hand, we show that for any p≥3p\geq 3 and k≥1k \geq 1 the problem is NP-hard, and, moreover, APX-hard. As a result on parameterized complexity, we show that for any k≥2k \geq 2, it is W[1]W[1]-hard with respect to pp to decide whether a given digraph can be made kk-arc-strong by applying a single inversion of size at most pp. We also prove that for a given multidigraph, it is W[1]W[1]-hard with respect to ℓ\ell to decide whether it can be made 2-arc-strong by applying ℓ\ell inversions of size 2.

查看此版本解读 →查看此版本原文 ↗