← 研踪 PaperTrailarXiv: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
摘要
For a digraph and some , the inversion of is the operation of flipping all arcs both of whose endvertices are in . 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 and , we give a characterization of the digraphs that can be made -arc-strong by applying inversions of size exactly , 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 and and any , there exists a polynomial-time -approximation algorithm for computing the minimum number of inversions of size at most that make a given digraph -arc-strong. This is in stark contrast to other results on inversion optimization problems. On the other hand, we show that for any and the problem is NP-hard, and, moreover, APX-hard. As a result on parameterized complexity, we show that for any , it is -hard with respect to to decide whether a given digraph can be made -arc-strong by applying a single inversion of size at most . We also prove that for a given multidigraph, it is -hard with respect to to decide whether it can be made 2-arc-strong by applying inversions of size 2.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v3 · 2026-11-18 10:29 · 最新观测版本
Increasing arc-connectivity by bounded- and fixed-size inversions
For a digraph and some , the inversion of is the operation of flipping all arcs both of whose endvertices are in . 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 and , we give a characterization of the digraphs that can be made -arc-strong by applying inversions of size exactly , 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 and and any , there exists a polynomial-time -approximation algorithm for computing the minimum number of inversions of size at most that make a given digraph -arc-strong. This is in stark contrast to other results on inversion optimization problems. On the other hand, we show that for any and the problem is NP-hard, and, moreover, APX-hard. As a result on parameterized complexity, we show that for any , it is -hard with respect to to decide whether a given digraph can be made -arc-strong by applying a single inversion of size at most . We also prove that for a given multidigraph, it is -hard with respect to to decide whether it can be made 2-arc-strong by applying inversions of size 2.
查看此版本解读 →查看此版本原文 ↗