Showing cs.DSShow all
2 papers · 1 filter
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.DS2021
FPT algorithms for packing -safe spanning rooted sub(di)graphs
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia +2
We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput. Sci. 2015] and by Bang-Jensen, Havet, and Yeo [Discret. Appl. Math. 2016] about finding disjoint "balanced…