Efficient data structures for sparse network representation

DOI10.1080/00207160701753629MaRDI QIDQ3523690zbMATH OpenOpenAlexFDO

Authors 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

cachedata structurecomplex networkhashinglinear probing

Mathematics Subject Classification ID

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

Recommendations

• Efficient graph representations
• Efficient computation of implicit representations of sparse graphs
• Efficient computation of sparse structures
• scientific article; zbMATH DE number 17137
• Sparsity. Graphs, structures, and algorithms
• External-memory network analysis algorithms for naturally sparse graphs
• Sparsification—a technique for speeding up dynamic graph algorithms
• scientific article; zbMATH DE number 3963090
• Implementing sparse matrices for graph algorithms

Cites work

• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• Complex networks: structure and dynamics
• Exact distribution of individual displacements in linear probing hashing
• Individual displacements for linear probing hashing with different insertion policies
• Symmetric binary B-trees: Data structure and maintenance algorithms
• The Structure and Function of Complex Networks

Cited in

(2)

• Efficient lookup on unstructured topologies
• Model of community emergence in weighted social networks

Describes a project that uses

Uses Software

• GraphBase

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523690)