On the connectivity of a network

DOI10.1016/0022-247X(81)90257-2MaRDI QIDQ1159084zbMATH OpenOpenAlexFDO

Authors 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

network connectivitycomputational resultsstopping rulescomputation 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

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• A note on two problems in connexion with graphs
• An Appraisal of Some Shortest-Path Algorithms
• Introduction to the mathematical theory of control processes. Vol. II:Nonlinear processes
• On a routing problem
• The Königsberg bridges problem generalized

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159084)