A Multi-Scale Algorithm for the Linear Arrangement Problem (2002)
Cached
Download Links
- [www.wisdom.weizmann.ac.il]
- [www.research.att.com]
- [www.wisdom.weizmann.ac.il]
- [www.wisdom.weizmann.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | Proc. 28th Inter. Workshop on Graph-Theoretic Concepts in Computer Science (WG’02), LNCS 2573 |
| Citations: | 25 - 4 self |
BibTeX
@INPROCEEDINGS{Koren02amulti-scale,
author = {Yehuda Koren and David Harel},
title = {A Multi-Scale Algorithm for the Linear Arrangement Problem},
booktitle = {Proc. 28th Inter. Workshop on Graph-Theoretic Concepts in Computer Science (WG’02), LNCS 2573},
year = {2002},
pages = {293--306},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Finding a linear ordering of the vertices of a graph is a common problem arising in diverse applications. In this paper we present a linear-time algorithm for this problem, based on the multi-scale paradigm. Experimental results are similar to those of the best known approaches, while the running time is significantly better, enabling it to deal with much larger graphs. The paper contains a general multi-scale construction, which may be used for a broader range of ordering problems.
