Project

Design of graph algorithms for complex network problems

Code
bof/baf/4y/2024/01/806
Duration
01 January 2024 → 31 December 2025
Funding
Regional and community funding: Special Research Fund
Research disciplines
  • Natural sciences
    • Information and communication, circuits
    • Communication networks
    • Analysis of algorithms and complexity
  • Engineering and technology
    • Computer communication networks
Keywords
graph theory algorithms logistics optimisation techniques communication networks
 
Project description

Network structures appear in a variety of application domains, ranging from computer and communication networks to transport&logistics and even biology and genetics.  New research challenges are faced in these domains, with ever growing network sizes.  New algorithmic techniques must be designed to tackle these challenges, leading to satisfactory solutions within reasonable computer computation times.

Starting from realistic problem descriptions (for instance routing in photonic meshes, traffic assignment in road networks or motifs in genetic networks), we will investigate how algorithmic techniques stemming from graph theory, optimization techniques, artificial intelligence and heuristics could be helpful to tackle the problem.  Novel algorithms will be designed to obtain qualitative results and enhance the performance.