As the era of exascale supercomputing is coming, it is vital for next-generation
supercomputers to find appropriate applications with high social and economic benefit. In …

Graph algorithms, such as Breadth First Search (BFS), Single Source Shortest Path (SSSP),
PageRank (PR), and Connected Components (CC), are increasingly important in big data …

Low-diameter network topologies require non-minimal routing, such as Valiant routing, to
avoid network congestion under challenging traffic patterns like the so-called adversarial …

Graph-based services are becoming integrated into everyday life through graph applications
and graph learning systems. While traditional graph processing approaches boast excellent …

Processing large-scale graphs with billions to trillions of edges requires efficiently utilizing
parallel systems. However, current graph processing engines do not scale well beyond a …

The paper attempts to use the motorization levels for analyzing the increase in traffic volume
across road links and network for roads of various hierarchies. Using a gravity model …

Graph data processing is essential for web-scale applications, including social networks,
recommendation systems, and web of things (WoT) systems, where large, sparsely …

BFS (Breadth-First Search) is a promising killer engine for graph processing and currently
has an extremely important role in real-time processing scenarios in everyday life …

As graph-based services have been widespreadly integrated into daily lives, extremely-fast
and scalable graph queries are receiving increasing attention. Graph querying al-gorithms …

BFS (Breadth-First Search) is a typical graph algorithm used as a key component of many
graph applications. However, current distributed parallel BFS implementations suffer from …