2 papers
cs.DS2026
Dynamic framework for edge-connectivity maintenance of simple graphs
Blazej Wrobel
We present a framework for dynamically maintaining -edge-connectivity of an undirected simple graph under edge insertions and deletions, where is a fixed constant. After…
cs.DM2025
Using random spanning trees in survivable networks design
Blazej Wrobel, Dominik Bojko
We investigate a process of joining random spanning trees on a fixed clique . The joined trees may not be disjoint and multiple edges are replaced by one simple edge. This…