A bidirectional shortest-path algorithm with good average-case behavior
type: Item
instance of: scholarly article
title: A bidirectional shortest-path algorithm with good average-case behavior
zbMATH Open document ID: 0681.68068
DOI: 10.1007/BF01553908
author: Michael Luby
author: Prabhakar Ragde
published in: Algorithmica
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4115973
zbMATH Keywords: probabilistic analysis
zbMATH Keywords: two-terminal shortest-path problem
zbMATH Keywords: bidirectonal search algorithm
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q3682518
cites work: A note on two problems in connexion with graphs
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q3048571
cites work: Analytic Inequalities
cites work: Q5679703
cites work: Q5606305
cites work: A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
Recommended article: Q3746901
Recommended article: Note on ``A new bidirectional algorithm for shortest paths''
Recommended article: An exact bidirectional pulse algorithm for the constrained shortest path
Recommended article: A Forward-Backward Single-Source Shortest Paths Algorithm
Recommended article: An empirical investigation of some bicriterion shortest path algorithms
Recommended article: New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches
Recommended article: Shortest path algorithms for nearly acyclic directed graphs
Recommended article: A new algorithm for the shortest‐path problem
Recommended article: An Appraisal of Some Shortest-Path Algorithms
description: scientific article; zbMATH DE number 4115973