Graph labeling is a central topic in combinatorial optimisation that involves assigning numerical or categorical labels to vertices or edges of a graph subject to specific constraints. This framework ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

Kolla’s research interests include spectral graph theory, algorithms, complexity, convex programming, statistical physics and quantum computing. Kolla is particularly interested in the use of spectral ...

Dynamic graph algorithms and data structures represent a vital research frontier in computer science, underpinning applications from network analysis to real-time system monitoring. These methods ...

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

CATALOG DESCRIPTION: Design and analysis of advanced algorithms: graph algorithms; maximal network flows; min-cost flow algorithms; convex cost flows. REQUIRED TEXT ...

Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...