scientific article; zbMATH DE number 5734730

MaRDI QIDQ3574271zbMATH OpenFDO

Authors Deepak Ajwani, Ulrich Meyer, Vitaly Osipov

Publication date 9 July 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Searching and sorting (68P10) Paths and cycles (05C38)

Recommendations

• Algorithms for searching paths in huge graphs
• Semi-dynamic breadth-first search in digraphs
• Parallel breadth-first search algorithms for trees and graphs
• Fast breadth-first search in still less space
• Theory and techniques for synthesizing efficient breadth-first search algorithms
• Breadth-first heuristic search
• A breadth-first search with betweenness
• Search problems on graphs

Cited in

(7)

• Theory and techniques for synthesizing efficient breadth-first search algorithms
• Semi-dynamic breadth-first search in digraphs
• Improved external memory BFS implementations
• An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs
• 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

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 Q3574271)