Efficient data structures for sparse network representation

DOI10.1080/00207160701753629zbMath1154.68369OpenAlexW2083060661MaRDI QIDQ3523690

Jörkki Hyvönen, Jari Saramäki, Kimmo Kaski

Publication date: 5 September 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701753629

zbMATH Keywords

cachehashingcomplex networklinear probingdata structure

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05)

Related Items (1)

Model of community emergence in weighted social networks

Uses Software

• GraphBase

Cites Work

• Complex networks: structure and dynamics
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Individual displacements for linear probing hashing with different insertion policies
• Exact distribution of individual displacements in linear probing hashing
• The Structure and Function of Complex Networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient data structures for sparse network representation