An algorithm for finding optimum path in networks

DOI10.1016/0016-0032(82)90032-1zbMath0493.90028OpenAlexW2077644036MaRDI QIDQ1168880

Kabekode V. S. Bhat

Publication date: 1982

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(82)90032-1

zbMATH Keywords

computational complexitysolution algorithmmaximal flow problemedge-sparse networkoptimal path searchsimple breadth-first search process

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Cites Work

• Parallel concepts in graph theory
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for finding optimum path in networks