Concepedia

Minimal congestion trees

Mikhail I. Ostrovskii

Discrete Mathematics · 2004 · 43 citations · 13 references

DOI

References

13

On the shortest spanning subtree of a graph and the traveling salesman problem

Joseph B. Kruskal · Proceedings of the American Mathematical Society · 1956 · 5.1K citations · Full text

, , +11

Shortest Connection Networks And Some Generalizations

R. C. Prim · Bell System Technical Journal · 1957 · 4.6K citations

, , +9

Otakar Borůvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history

Jaroslav Nešetřil, Eva Milková, Helena Nešetřilová · Discrete Mathematics · 2001 · 304 citations · Full text

, , +10

A polynomial algorithm for the min-cut linear arrangement of trees

Mihalis Yannakakis · Journal of the ACM · 1985 · 127 citations · Full text

, , +10

The congestion of n-cube layout on a rectangular grid

S.L. Bezrukov, J.D. Chavez, L. H. Harper et al. · Discrete Mathematics · 2000 · 97 citations

, , +7