Algorithms for searching paths in huge graphs

DOI10.1007/s10958-015-2612-1zbMath1329.05165OpenAlexW2274896985MaRDI QIDQ906255

A. M. Chepovskiy, I. V. Polyakov, A. 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

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Distance in graphs (05C12) Data structures (68P05)

Uses Software

• DIMACS

Cites Work

• A note on two problems in connexion with graphs
• An Algorithm for Partitioning the Nodes of a Graph
• Fibonacci heaps and their uses in improved network optimization algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for searching paths in huge graphs