43 search results - page 1 / 9 » Double Clustering and Graph Navigability |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
IV
2005
IEEE
13 years 10 months ago
2005
IEEE
Visualising large graphs faces the challenges of both data complexity and visual complexity. This paper presents a framework for visualising large graphs that reduces data complex...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a study of the web based user navigation patterns mining and propose a novel approach for clustering of user navigation patterns. The approach is based on the graph par...
SIROCCO
2008
13 years 6 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
VL
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...