On the connectivity of a network

DOI10.1016/0022-247X(81)90257-2zbMath0474.90080OpenAlexW2090166863MaRDI QIDQ1159084

Mohammad Roosta

Publication date: 1981

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(81)90257-2

zbMATH Keywords

computational resultsstopping rulesnetwork connectivitycomputation time estimationverification algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• The Königsberg bridges problem generalized
• Introduction to the mathematical theory of control processes. Vol. II:Nonlinear processes
• On a routing problem
• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: On the connectivity of a network