Processing Huge Graphs with Stxxl

DOI10.1016/J.ENDM.2006.06.060MaRDI QIDQ3439465zbMATH OpenOpenAlexFDO

Authors Roman Dementiev

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.060

zbMATH Keywords

algorithm engineeringexternal memorygraph algorithmsI/O-efficient algorithmslarge data sets

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites work

• A computational study of external-memory BFS algorithms
• scientific article; zbMATH DE number 2163020 (Why is no real title available?)

Describes a project that uses

Uses Software

• STXXL

This page was built for publication: Processing Huge Graphs with Stxxl

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