Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

AbstractFor a non-trivial connected graph 𝐺, a set 𝑆 ⊆ 𝑉 (𝐺) is called an edge geodetic set of 𝐺 if every edge of 𝐺 is contained in a geodesic joining some pair of vertices in 𝑆. The edge ...

Connected component labeling (CCL) is a fundamental operation within image processing and computer vision, serving as the backbone for tasks such as object recognition, segmentation, and analysis. At ...

On the 19th of February 2025, M.Sc. Andreas Grigorjew defends his PhD thesis on Algorithms and Graph Structures for Splitting Network Flows, in Theory and Practice. The thesis is related to research ...