Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

EDBT
2008
ACM

favoriteEmaildiscussreport

177views Database» more EDBT 2008»

Fast computing reachability labelings for large graphs with high compression rate

14 years 4 months ago

Fast computing reachability labelings for large graphs with high compression rate

Download www.se.cuhk.edu.hk

Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W

Real-time Traffic

Database | EDBT 2008 |

claim paper

Related Content

» Fast Computation of Reachability Labeling for Large Graphs

» Fast NearLossless or Lossless Compression of Large 3D NeuroAnatomical Images

» Neighborhood based fast graph search in large networks

» Optimized Edgebreaker Encoding for Large and Regular Triangle Meshes

» Mining Frequent Subgraph by Incidence Matrix Normalization

» A lookahead strategy for solving large planning problems

» The Design of a Pressure Sensing Floor for MovementBased Human Computer Interaction

» A hybrid blobslice model for accurate and efficient detection of fluorescence labeled nucl...

» CBDAM Compressed Batched Dynamic Adaptive Meshes for Terrain Rendering

Post Info
More Details (n/a)

Added	08 Dec 2009
Updated	08 Dec 2009
Type	Conference
Year	2008
Where	EDBT
Authors	Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu

Comments (0)