loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Data Compression Conference (DCC'06)
Snowbird, Utah
March 28-March 30
ISBN: 0-7695-2545-8
ASCII Text
x 
 
A. Mahdian, H. Khalili, E. Nourbakhsh, M. Ghodsi, "Web Graph Compression by Edge Elimination," Data Compression Conference, pp. 459, Data Compression Conference (DCC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2006.84,
author = {A. Mahdian and H. Khalili and E. Nourbakhsh and M. Ghodsi},
title = {Web Graph Compression by Edge Elimination},
journal ={Data Compression Conference},
volume = {0},
year = {2006},
issn = {1068-0314},
pages = {459},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2006.84},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Web Graph Compression by Edge Elimination
SN - 1068-0314
SP
EP
A1 - A. Mahdian,
A1 - H. Khalili,
A1 - E. Nourbakhsh,
A1 - M. Ghodsi,
PY - 2006
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
A. Mahdian, Sharif University of Technology, Iran
H. Khalili, Sharif University of Technology, Iran
E. Nourbakhsh, Sharif University of Technology, Iran
M. Ghodsi, Sharif University of Technology, Iran
In our work we focus on the problem of compressing the web graph by means of eliminating some of the edges in its link structure. Our algorithm divides the task, so that it can be executed on parallel processors.
Citation:
A. Mahdian, H. Khalili, E. Nourbakhsh, M. Ghodsi, "Web Graph Compression by Edge Elimination," dcc, pp.459, Data Compression Conference (DCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.