Computing the reachability between two vertices in a graph is a fundamental problem in
graph data analysis. Most of the existing works assume that the edges in the graph have no …

Recent research has explored the use of Large Language Models (LLMs) for tackling
complex graph reasoning tasks. However, due to the intricacies of graph structures and the …

Shortest path query on road networks is a fundamental problem to support many location-
based services and wide variant applications. Contraction Hierarchies (CH) is widely …

Comprehensive evaluation is one of the basis of experimental science. In High-Performance
Graph Processing, a thorough evaluation of contributions becomes more achievable by …

Alerts are an essential tool for the detection of anomalies and ensuring the smooth operation
of online service systems by promptly notifying engineers of potential issues. However, the …

As one of the most well-studied cohesive subgraph models, the $ k $-core is widely used to
find graph nodes that are``central''or``important''in many applications, such as biological …

Graph edge coloring problem is a branch of the graph coloring problem and is a classic NP-
hard problem in graph theory. The goal of edge coloring is to minimize the number of colors …

In light of social networks' expansion and the ever-increasing number of subscribers who
daily sign up to them. Detecting and counting triangles of subscribers in these networks are …

Recent research has explored the use of Large Language Models (LLMs) for tackling
complex graph reasoning tasks. However, due to the intricacies of graph structures and the …