Die Bestimmung kürzester Pfade in Graphen und passende Datenstrukturen

DOI10.1007/BF02234053zbMATH Open0237.68006OpenAlexW117556039MaRDI QIDQ2552748FDOQ2552748

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

• A note on two problems in connexion with graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Solutions of the Shortest-Route Problem—A Review
• Title not available (Why is that?)
• Bestimmung minimaler Wege in endlichen, gerichteten, bewerteten Graphen
• Title not available (Why is that?)

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)