Coxeter theory investigates groups generated by reflections and the geometric structures arising from their actions, such as root systems and Dynkin diagrams. This body of work underpins vast areas of ...
Graph algorithms and network analysis form the backbone of modern computational techniques used to decode the complex structures and dynamic behaviours exhibited by diverse real-world networks. From ...
Abstract Forty years ago, Kleitman considered the numbers of crossings in good planar drawings of the complete bipartite graph ${K_{m,n}}$. Among other things, he ...
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 ...
4monon MSN
Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback