Submitted works

Advanced search

cs.DS — Data Structures and Algorithms

Deterministic almost-linear time for general matching and network flow

Contributed by Yilin Liu

We give deterministic almost-linear-time algorithms for maximum-cardinality matching in general graphs and integral minimum-cost flow. With H=n+m+2H = n + m + 2, both run in Hexp⁡O((log⁡H)4/5(log⁡log⁡H)1/5)H \exp O((\log H)^{4/5}(\log \log H)^{1/5}) time for polynomially bounded integer flow data. Their circulation oracle charges every traversal of a returned walk. A clipped logarithmic potential handles flow thresholds under improving updates and maintains strong components under arc insertions. For subgraphs with degree bounds, two matching computations encode a factor of every feasible size. The underlying exchange argument also gives integral cardinality slices for capacitated factors and is compatible with sharp local rounding.

Primarily AI-generated textHuman understanding: no partsalmost-linear timedeterministic graph algorithmsgraph factorsmaximum-cardinality matchingminimum-cost flowminimum-ratio cycles
Nov 19, 202616 pages
PDFView work

cs.CC — Computational Complexity

Black-box identity testing for affine orbits of read-once oblivious algebraic branching programs

Contributed by Yilin Liu

For every fixed width, we construct a polynomial-size hitting set for read-once oblivious algebraic branching programs under an unknown invertible affine change of variables. A width bound in a single unknown order suffices. The resulting deterministic black-box identity test runs in time polynomial in the number of variables and the total degree over every field with more elements than the degree. The construction preserves the generic ranks of consecutive matrix products in descending order. At fixed dimension and width, the query count is linear in the total degree in characteristic zero or above the individual degree in the hidden coordinates. When the width bound holds in every order, cut ranks give linear dependence up to logarithmic factors even in small characteristic. We also treat multivariate layers with bounded overlap and obtain a linear query bound for bivariate programs of width two.

Primarily AI-generated textHuman understanding: no partsaffine orbitshitting setspolynomial identity testingread-once oblivious algebraic branching programs
Nov 19, 202618 pages
PDFView work