Sciweavers

157 search results - page 2 / 32
» Compact representations of separable graphs
Sort
View
SPIRE
2007
Springer
13 years 10 months ago
A Fast and Compact Web Graph Representation
Compressed graphs representation has become an attractive research topic because of its applications to the manipulation of huge Web graphs in main memory. By far the best current ...
Francisco Claude, Gonzalo Navarro
SPIRE
2009
Springer
13 years 11 months ago
k2-Trees for Compact Web Graph Representation
The directed graph representation of the World Wide Web has been extensively used to analyze the Web structure, behavior and evolution. However, those graphs are huge and do not ï...
Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
CPM
2008
Springer
149views Combinatorics» more  CPM 2008»
13 years 6 months ago
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Let G be an unweighted and undirected graph of n nodes, and let D be the n
Igor Nitto, Rossano Venturini
IPPS
2009
IEEE
13 years 11 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
TWEB
2010
81views more  TWEB 2010»
13 years 2 months ago
Fast and Compact Web Graph Representations
Francisco Claude, Gonzalo Navarro