This paper investigates ultrafilters in the context of connectivity systems, defined as pairs (X,
f) where X is a finite set and f is a symmetric submodular function. Ultrafilters, essential in …

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 …

Shortest path counting computes the number of shortest paths between two vertices on a
graph, which can be used in the applications such as social network search and POI (Point …

Shortest path queries are ubiquitous in many spatial applications. Existing solutions assign
numerical weights to edges and compute the path with the minimum sum of edge weights …

Structural clustering (SCAN) is one of the most popular graph clustering paradigms.
However, SCAN assumes that the input graph is undirected and can not cluster the directed …

Bipartite graphs are widely used to capture the relationships between two types of entities. In
bipartite graph analysis, finding the maximum balanced biclique (MBB) is an important …

Community search over bipartite graphs has attracted significant interest recently. In many
applications such as the user–item bipartite graph in e-commerce and customer–movie …

Distance labeling approaches are widely adopted to speed up the shortest-distance query
performance. Due to the explosive growth of data graphs, a single machine can hardly …

Biclique percolation community (BPC) search is a fundamental problem in bipartite graph
analysis and have many applications. Existing online approach has to enumerate all the …

The Constrained Shortest Path (CSP) problem seeks to identify the shortest path between
two vertices in a road network while adhering to a specific constraint on another criterion …