Research repository for cost-effective deployment and optimisation of next-generation (B5G/6G) reconfigurable RAN and optical X-haul networks. Features greedy, genetic algorithm, local search, and ...

Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...

Abstract: Graph cut algorithms are popular in optimization tasks related to min-cut and max-flow problems. However, modern FPGA graph cut algorithm accelerators still need performance and memory ...

The methodology presented here is described in depth in Kalirad, A., & Sommer, R. J. (2025). Ecological graph theory: Simulating competition and coexistence on graphs ...