2 citations · 5 across the 10 of their papers we have counts for
4 papers · 1 filter
Packing of mixed hyperarborescences with flexible roots via matroid intersection
Florian Hörsch, Zoltán Szigeti
Given a mixed hypergraph , functions and an integer , a packing of spanning mixed hyperarboresce…
Connectivity of orientations of 3-edge-connected graphs
Florian Hörsch, Zoltán Szigeti
We attempt to generalize a theorem of Nash-Williams stating that a graph has a -arc-connected orientation if and only if it is -edge-connected. In a strongly connected digra…
Reachability in arborescence packings
Florian Hörsch, Zoltán Szigeti
Fortier et al. proposed several research problems on packing arborescences. Some of them were settled in that article and others were solved later by Matsuoka and Tanigawa and by G…
The -connectivity augmentation problem: Algorithmic aspects
Florian Hörsch, Zoltán Szigeti
Durand de Gevigney and Szigeti \cite{DgGSz} have recently given a min-max theorem for the -connectivity augmentation problem. This article provides an $O(n^3(m+ n \textrm{ }…