—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...