While advances in computing resources have made processing enormous amounts of data
possible, human ability to identify patterns in such data has not scaled accordingly. Efficient …

We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

Training on large-scale graphs has achieved remarkable results in graph representation
learning, but its cost and storage have attracted increasing concerns. Existing graph …

Given the prevalence of large-scale graphs in real-world applications, the storage and time
for training neural models have raised increasing concerns. To alleviate the concerns, we …

Distributed computing concerns environments in which many processors, located at different
sites, must operate in a noninterfering and cooperative manner. Each of the processors …

In this paper we explore some implications of viewing graphs as geometric objects. This
approach offers a new perspective on a number of graph-theoretic and algorithmic …

Designing, implementing, and operating a wireless sensor network involves a wide range of
disciplines and many application-specific constraints. To make sense of and take advantage …

Let G=(V, E) be an undirected weighted graph with| V|= n and| E|= m. Let k≥ 1 be an
integer. We show that G=(V, E) can be preprocessed in O (kmn 1/k) expected time …

Given a graph G, a subgraph G'is at-spanner of G if, for every u, v ɛ V, the distance from u to
v in G'is at most t times longer than the distance in G. In this paper we give a simple …

Bipartite graphs are perhaps the most basic of objects in graph theory, both from a
theoretical and practical point of view. However, sometimes they have been considered only …