Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.
Bar-Yehuda, Reuven ; Even, Guy ; Feldmann, Jon ; Naor, Joseph
Journal of Graph Algorithms and Applications, Tome 5 (2001), p. 1-27 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:49188 
@article{01668942,
     title = {Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {5},
     year = {2001},
     pages = {1-27},
     zbl = {0985.68093},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01668942}
}

Bar-Yehuda, Reuven; Even, Guy; Feldmann, Jon; Naor, Joseph. Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.. Journal of Graph Algorithms and Applications, Tome 5 (2001) pp. 1-27. http://gdmltest.u-ga.fr/item/01668942/