Second-order random walk is an important technique for graph analysis. Many applications
including graph embedding, proximity measure and community detection use it to capture …

A fundamental query in labeled graphs is to determine if there exists a path between a given
source and target vertices, such that the path satisfies a given label constraint. One of the …

Reachability is a fundamental problem in graph analysis. In applications such as social
networks and collaboration networks, edges are always associated with timestamps. Most …

SPARQL property path queries provide a succinct way to write complex navigational queries
over RDF knowledge graphs. However, their evaluation remains difficult as they may involve …

Second-order random walk is an important technique for graph analysis. Many applications
use it to capture higher-order patterns in the graph, thus improving the model accuracy …

Graph is a famous data structure that has prevalent applications in the real world, including
social networks, biological networks, and computer networks. In these applications, graph …

Real-world directed graphs are dynamically changing, and it is important to identify and
maintain the strong connectivity information between nodes, which is useful in numerous …

Reachability is a fundamental problem in graph analysis. In applications such as social
networks and collaboration networks, edges are always associated with timestamps. Most …

Reachability query plays a vital role in many graph analysis tasks. Previous researches
proposed many methods to efficiently answer reachability queries between vertex pairs …

Reachability is a fundamental graph operator. State-of-the-art index-based reachability
processing frameworks can efficiently handle static graphs, but the recent advent of dynamic …