Minimal numberings of the vertices of trees — Approximate approach
- 1 January 1987
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 214-217
- https://doi.org/10.1007/3-540-18740-5_44
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On optimal linear arrangements of treesComputers & Mathematics with Applications, 1984
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 1982
- A Minimum Linear Arrangement Algorithm for Undirected TreesSIAM Journal on Computing, 1979
- A Review of the Placement and Quadratic Assignment ProblemsSIAM Review, 1972