A note on two problems in connexion with graphs

DOI10.1007/bf01386390zbMath0092.16002WikidataQ21694527 ScholiaQ21694527MaRDI QIDQ78129

Edsger W. Dijkstra, Edsger W. Dijkstra

Publication date: December 1959

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131436

zbMATH Keywords

topology

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Maximal Flow Through a Network