Eco-friendly navigation (aka eco-routing) finds a route from A to B in a road network that
minimizes the greenhouse gas (GHG) emission or fuel/energy consumption of the traveling …

A significant proportion of all search volume consists of local searches. As a result, search
engines must be capable of finding relevant results combining both spatial proximity and …

Under the background of global warming, lake changes in the Qinghai–Tibet Plateau and
their impacts have been widely concerned. To avoid downloading and preprocessing …

The k nearest neighbor (k NN) query is an essential graph data-management tool used for
finding relevant data entities suited to a user-specified query node. Graph indexing methods …

Effective resistance (ER) is a fundamental metric for measuring node similarities in a graph,
and it finds applications in various domains including graph clustering, recommendation …

Location-based services rely heavily on efficient methods that search for relevant points-of-
interest (POIs) close to a given location. A k nearest neighbors (kNN) query is one such …

Hub labeling based shortest distance querying plays a key role in many important
networked graph applications, such as route planning, socially-sensitive search and web …

Customizable contraction hierarchies are one of the most popular route planning
frameworks in practice, due to their simplicity and versatility. In this work, we present a novel …

k nearest neighbor (k NN) query is an essential graph data management tool to find relevant
data entities suited to a user-specified query node. Graph indexing methods have the …

Abstract k-nearest neighbor (k NN) search is a fundamental problem in graph mining. This
search finds the k most relevant nodes to a given query node. The increased use of social …