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 (2001)
- Volume: 5, Issue: 4, page 1-27
- ISSN: 1526-1719
Access Full Article
topHow to cite
topBar-Yehuda, Reuven, et al. "Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.." Journal of Graph Algorithms and Applications 5.4 (2001): 1-27. <http://eudml.org/doc/49188>.
@article{Bar2001,
author = {Bar-Yehuda, Reuven, Even, Guy, Feldmann, Jon, Naor, Joseph},
journal = {Journal of Graph Algorithms and Applications},
keywords = {vertex ordering problems},
language = {eng},
number = {4},
pages = {1-27},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.},
url = {http://eudml.org/doc/49188},
volume = {5},
year = {2001},
}
TY - JOUR
AU - Bar-Yehuda, Reuven
AU - Even, Guy
AU - Feldmann, Jon
AU - Naor, Joseph
TI - Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.
JO - Journal of Graph Algorithms and Applications
PY - 2001
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 5
IS - 4
SP - 1
EP - 27
LA - eng
KW - vertex ordering problems
UR - http://eudml.org/doc/49188
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.