External memory BFS on undirected graphs with bounded degree.

MaRDI QIDQ2768276zbMATH OpenFDO

Authors Ulrich Meyer

Publication date 30 January 2002

zbMATH Keywords

breadth-first search

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1947435
• scientific article; zbMATH DE number 1445387
• On dynamic breadth-first search in external-memory
• Improved external memory BFS implementations
• A computational study of external-memory BFS algorithms

Cited in

(14)

• An external-memory depth-first search algorithm for general grid graphs
• A computational study of external-memory BFS algorithms
• Via Detours to I/O-Efficient Shortest Paths
• scientific article; zbMATH DE number 1947435 (Why is no real title available?)
• scientific article; zbMATH DE number 1522938 (Why is no real title available?)
• On dynamic breadth-first search in external-memory
• scientific article; zbMATH DE number 1445387 (Why is no real title available?)
• A framework for in-place graph algorithms
• External memory algorithms for finding disjoint paths in undirected graphs
• Improved external memory BFS implementations
• KI 2004: Advances in Artificial Intelligence
• Optimal cache-oblivious mesh layouts
• Certifying induced subgraphs in large graphs
• External-memory depth-first search algorithm for solid grid graphs

This page was built for publication: External memory BFS on undirected graphs with bounded degree.

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