2 papers
cs.DS2025
Odd and Even Harder Problems on Cycle-Factors
Florian Hörsch, Csaba Király, Mirabel Mendoza-Cadena +3
For a graph (undirected, directed, or mixed), a cycle-factor is a collection of vertex-disjoint cycles covering the entire vertex set. Cycle-factors subject to parity constraints a…
cs.DS2025
LZBE: an LZ-style compressor supporting -time random access
Hiroki Shibata, Yuto Nakashima, Yutaro Yamaguchi +1
An LZ-like factorization of a string divides it into factors, each being either a single character or a copy of a preceding substring. While grammar-based compression schemes suppo…