Algorithms for searching paths in huge graphs
DOI10.1007/S10958-015-2612-1zbMATH Open1329.05165OpenAlexW2274896985MaRDI QIDQ906255FDOQ906255
Authors: I. V. Polyakov, A. A. Chepovskiĭ, A. Chepovskiy 
Publication date: 21 January 2016
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-015-2612-1
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Searching and sorting (68P10) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- A note on two problems in connexion with graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- An Algorithm for Partitioning the Nodes of a Graph
- Computing the shortest path: \(A^\ast\) search meets graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (2)
Uses Software
This page was built for publication: Algorithms for searching paths in huge graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906255)
