GA-TNG · Geometric algorithms for transport network graphs

Lines connect the coordinator with its partners.

Project objective

Graphs have been used to analyse transport networks for hundreds of years. However, graphs are general structures and many graph algorithms are very slow. Specialised algorithms are much more efficient but can only be applied to restricted graph classes. Transport network graphs suffer from a lack of efficient specialised algorithms, since most graph classes are too restrictive and do not accurately represent real-world transport networks. Recent developments have led to geometric graph classes that are tailored to real-world transport networks. One of these geometric graph classes, phi-low-density graphs, captures the property that there are more connections between geographically nearby nodes than geographically distant ones. Unfortunately, the fundamental properties of phi-low-density graphs are not well understood, which has prevented the development of a wide range of specialised algorithms. My objective is to fill the acute need for a simple and versatile graph class that accurately represents real-world transport networks. My research will allow experts to finally harness the power of specialised algorithms on a wide range of important transport network problems. I will achieve my objectives through two sub-objectives: (1) To build fundamental structures for phi-low-density graphs, and (2) To design provably efficient specialised algorithms for phi-low-density graphs. I will be support by my host institution (University of Copenhagen), my host group (Basic Algorithms Research Copenhagen), my primary supervisor (Mikkel Abrahamsen), and my secondary supervisor (Rasmus Pagh).

Original text from CORDIS.

Participants

• KOBENHAVNS UNIVERSITET · KOBENHAVNCoordinatorDenmark

Links

• View on CORDIS
• DOI: 10.3030/101146276
• https://ec.europa.eu/research/participants/documents/downloadPublic?documentIds=080166e52282ec51&appId=PPGMS