Die Bestimmung kürzester Pfade in Graphen und passende Datenstrukturen

DOI10.1007/BF02234053MaRDI QIDQ2552748zbMATH OpenOpenAlexFDO

Authors D. Braess

Publication date 1971

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02234053

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3265579 (Why is no real title available?)
• scientific article; zbMATH DE number 3273621 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3347910 (Why is no real title available?)
• A note on two problems in connexion with graphs
• Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen
• Solutions of the Shortest-Route Problem—A Review

Cited in

(1)

• Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems

This page was built for publication: Die Bestimmung kürzester Pfade in Graphen und passende Datenstrukturen

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