186 search results - page 23 / 38 » Speeding up algorithms on compressed web graphs |
VIIP
2001
13 years 8 months ago
2001
Most of the previous multiresolution models use exclusively the triangle graphic primitive both in the data structure and in the rendering stage. Only a few models use another gra...
ALENEX
2009
13 years 8 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
WG
2004
Springer
14 years 25 days ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
PDP
2006
IEEE
14 years 1 months ago
2006
IEEE
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
Mining graph data is an increasingly popular challenge, which has practical applications in many areas, including molecular substructure discovery, web link analysis, fraud detect...