A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Modern-day computers are characterized by a striking contrast between the processing power of the CPU and the latency of main memory accesses. If the data processed is both large compared to processor caches and sparse or high-dimensional in nature, as is commonly the case in complex network research, the main memory latency can become a performace bottleneck. In this Article, we present a cache efficient data structure, a variant of a linear probing hash table, for representing edge sets ofdoi:10.1080/00207160701753629 fatcat:gxva4pkgijhibhlh2oyo76p5ca