Journal of the ACM Bibliography
Mihalis Yannakakis. A
polynomial algorithm for the min-cut linear arrangement of trees.
Journal of the ACM, 32(4):950-988, October 1985.
[BibTeX entry]
Selected papers that cite this one
- Sanjeev Arora, Alan Frieze, and Haim Kaplan. A new rounding procedure for
the assignment problem with applications to dense graph arrangement
problems. In 37th Annual Symposium on Foundations of Computer
Science, pages 21-30, Burlington, Vermont, 14-16 October 1996.
IEEE.
- Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna,
Paul G. Spirakis, and Jacobo Toran. Parallel algorithms for
the minimum cut and the minimum length tree layout problems.
Theoretical Computer Science, 181(2):267-287, 30 July 1997.
- J. A. Ellis, I. H. Sudborough, and J. S. Turner. The vertex separation and search
number of a graph. Information and Computation,
113(1):50-79, 15 August 1994.
Shortcuts: