scientific article; zbMATH DE number 5734730
From MaRDI portal
Publication:3574271
zbMATH Open1330.68052MaRDI QIDQ3574271FDOQ3574271
Authors: Deepak Ajwani, Ulrich Meyer, Vitaly Osipov 
Publication date: 9 July 2010
Title of this publication is not available (Why is that?)
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
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)
Cited In (7)
- Theory and techniques for synthesizing efficient breadth-first search algorithms
- Improved external memory BFS implementations
- Semi-dynamic breadth-first search in digraphs
- An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs
- Fast breadth-first search in still less space
- An implementation of I/O-efficient dynamic breadth-first search using level-aligned hierarchical clustering
- Traversing graphs in a paging environment, BFS or DFS?
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)
