The modern science of networks has brought significant advances to our understanding of
complex systems. One of the most relevant features of graphs representing real systems is …

The modern science of networks has made significant advancement in the modeling of
complex real-world systems. One of the most important features in these networks is the …

In complex networks, each node has some unique characteristics that define the importance
of the node based on the given application-specific context. These characteristics can be …

In this paper we study approximate landmark-based methods for point-to-point distance
estimation in very large networks. These methods involve selecting a subset of nodes as …

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 …

Estimating the importance or centrality of the nodes in large networks has recently attracted
increased interest. Betweenness is one of the most important centrality indices, which …

The present disclosure provides a fast approximate as well as exact hierarchical network
storage and retrieval system and method for encoding and indexing graphs or networks as …

Graph clustering has become ubiquitous in the study of relational data sets. We examine two
simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan …

Shortest distance query is a fundamental operation in large-scale networks. Many existing
methods in the literature take a landmark embedding approach, which selects a set of graph …

In social networks such as Orkut, www. orkut. com, a large portion of the user queries refer to
names of other people. Indeed, more than 50% of the queries in Orkut are about names of …