Algorithms for searching paths in huge graphs

DOI10.1007/S10958-015-2612-1MaRDI QIDQ906255zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

shortest path problemhuge graphs

Mathematics Subject Classification ID

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

• scientific article; zbMATH DE number 3129892 (Why is no real title available?)
• scientific article; zbMATH DE number 5734722 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An Algorithm for Partitioning the Nodes of a Graph
• Computing the shortest path: \(A^\ast\) search meets graph theory
• Fibonacci heaps and their uses in improved network optimization algorithms

Cited in

(2)

• scientific article; zbMATH DE number 1942448 (Why is no real title available?)
• scientific article; zbMATH DE number 5734730 (Why is no real title available?)

Describes a project that uses

Uses Software

• DIMACS

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)