Subgraph counting is a fundamental graph analysis task which has been widely used in
many applications. As the problem of subgraph counting is NP-complete and hence …

Network biology, an interdisciplinary field at the intersection of computational and biological
sciences, is critical for deepening understanding of cellular functioning and disease. While …

Subgraph matching is a fundamental problem in various fields that use graph structured
data. Subgraph matching algorithms enumerate all isomorphic embeddings of a query …

As a fundamental data structure, graphs are ubiquitous in various applications. Among all
types of graphs, signed bipartite graphs contain complex structures with positive and …

Supergraph search is a fundamental graph query processing problem. Supergraph search
aims to find all data graphs contained in a given query graph based on the subgraph …

Graph convolutional networks are widely used as computational models that integrate the
data of image and non-image modalities in the medical diagnostic domain, especially while …

Graphs have been widely adopted in various fields, where many graph models are
developed. Most of previous research focuses on unipartite or homogeneous graph …

To improve forecasting accuracy and capture intricate interactions within transportation
networks, information fusion approaches are crucial for traffic predictions based on graph …

The interactions between structured entities play important roles in a wide range of
applications such as chemistry, material science, biology, and medical science. Recently …

The classic problem of exact subgraph matching returns those subgraphs in a large-scale
data graph that are isomorphic to a given query graph, which has gained increasing …