… large-scale databases [1] and semantic document retrieval [2]. A na€ıve approach to K-NNS
is to compute … For every algorithm, we carefully chose the best results at every recall range …

… Results of the study indicate that the proposed graphical and … may be useful in assessing
and modeling user navigation. … suited to computational analysis and labeled directed graphs (…

… scalable algorithms for computing them on large graphs. We also … of its Degree centrality
by its Katz centrality scores. At the … our results perfectly agree with the statement of Theorem 2. …

… surveys of graph visualization and navigation techniques … for other kinds of graphs; its results
are very sensitive to the … trees will results in quite different layouts for the same graph. The …

… Viz[1] package to compute the node-link diagram. It could be … 2, we note that, with regards
to large graphs, 96% of the users … -link diagrams, except for large graphs whose score falls as …

… Then, we discuss several approaches to navigation of large graphs (Section 3), followed by
… This section looks at the current results in graph drawing and layout algorithms, but from the …

… The simulation results can be … work on navigable movies contributed to the development
of the object movie. Most of the work reported on in this paper began in the Computer Graphics …

… We explore two approaches to compute the seed path. For … consider the inverses of the
navigability score and adopt a … high navigability scores to the corresponding edges in the graph. …

… efficiently manipulate large graphs, calculate structural properties, generate regular and
random graphs, and … a provably accurate approximation of the personalized PageRank score. …

… , we compute a score for each landmark and select one with the highest score. We use a …
The full graph is too big for the computer used in our experiments, so we ran experiments on …