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, ...

Understanding the network organization of the brain has been a long-standing challenge for neuroscience. In the past decade, developments in graph theory have provided many new methods for ...

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 ...

New research shows that metasurfaces could be used as strong linear quantum optical networks This approach could eliminate the need for waveguides and other conventional optical components Graph ...