pathpyG
pathpyG copied to clipboard
Implement HOTVis
The task would be to implement the higher-order force-directed layout algorithm from the following paper:
Perri, V., Scholtes, I. (2020). HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs. In: Auber, D., Valtr, P. (eds) Graph Drawing and Network Visualization. GD 2020. Lecture Notes in Computer Science(), vol 12590. Springer, Cham. https://doi.org/10.1007/978-3-030-68766-3_8
In addition, an empirical investigation of the algorithm, comparing it to a standard Fruchterman-Reingold layout, should be performed.