• DOI:10.1007/BF01386390
Corpus ID: 123284777

A note on two problems in connexion with graphs

@article{Dijkstra1959ANO,
  title={A note on two problems in connexion with graphs},
  author={E. Dijkstra},
  journal={Numerische Mathematik},
  year={1959},
  volume={1},
  pages={269-271}
}

E. Dijkstra

Published 1959

Computer Science, Mathematics

Numerische Mathematik

We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes. We now consider two problems. Problem 1. Constrnct the tree of minimum total length between the n nodes. (A tree is a graph with one and only one path between every two nodes.) In the course of the construction that we present here, the branches are subdivided into three sets: I. the… CONTINUE READING

View on Springer

www-m3.ma.tum.de

Save to Library

Create Alert

Cite

Launch Research Feed