scientific article; zbMATH DE number 1947435

MaRDI QIDQ4411404zbMATH OpenFDO

Authors K. Mehlhorn, Ulrich Meyer

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610723.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• External memory BFS on undirected graphs with bounded degree.
• Publication:4952710
• On dynamic breadth-first search in external-memory
• Improved external memory BFS implementations
• A computational study of external-memory BFS algorithms

Cited in

(22)

• Theory and techniques for synthesizing efficient breadth-first search algorithms
• On dynamic breadth-first search in external-memory
• A computational study of external-memory BFS algorithms
• I/O-efficient algorithms for graphs of bounded treewidth
• Improved external memory BFS implementations
• Semi-external LTL Model Checking
• External memory BFS on undirected graphs with bounded degree.
• I/O-efficient data structures for colored range and prefix reporting
• External memory algorithms for finding disjoint paths in undirected graphs
• On Trade-Offs in External-Memory Diameter-Approximation
• Fast breadth-first search in still less space
• Traversing graphs in a paging environment, BFS or DFS?
• An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering
• Certifying induced subgraphs in large graphs
• scientific article; zbMATH DE number 1445387 (Why is no real title available?)
• Efficient semi-external depth-first search
• Design and implementation of a practical I/O-efficient shortest paths algorithm
• Optimal cache-oblivious mesh layouts
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• Via Detours to I/O-Efficient Shortest Paths
• Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications

This page was built for publication:

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