1 citations · 1 across the 3 of their papers we have counts for
8 papers · 1 filter
Packing mixed hyperarborescences
Zoltán Szigeti
The aim of this paper is twofold. We first provide a new orientation theorem which gives a natural and simple proof of a result of Gao, Yang \cite{GY} on matroid-reachability-based…
On reversing arcs to improve arc-connectivity
Pierre Hoppenot, Zoltán Szigeti
We show that if the arc-connectivity of a directed graph is at most and the reorientation of an arc set in results in a -arc-connected…
Directed hypergraph connectivity augmentation by hyperarc reorientations
Moritz Mühlenthaler, Benjamin Peyrille, Zoltán Szigeti
The orientation theorem of Nash-Williams states that an undirected graph admits a -arc-connected orientation if and only if it is -edge-connected. Recently, Ito et al. showe…
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…
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{ }…