A. V. Aho, M. R. Garey, and J. D. Ullman. The transitive reduction of a directed graph. SIAM Journal on Computing, 1(2):131137, 1972.
 R. Bar-Yehuda, G. Even, J. Feldman, and J. Naor. Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems. J. Graph Algorithms Appl., 5(4):127, 2001.
 R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1):8790, 1958.
 A. Brandstδdt, B. Van Le, and J. P. Spinrad. Graph classes: a survey. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1999.
 E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269271, 1959.
 L. R. Ford. Network flow theory. Technical Report P-923, RAND Corp., Santa Monica, CA, USA, 1956.
 M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596615, 1987.
 M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979.
 L. H. Harper. Optimal assignments of numbers to vertices. Journal of the Society for Industrial and Applied Mathematics, 12(1):131135, 1964.
 B. Hendrickson and R. Leland. The Chaco Users Guide Version 2.0. Sandia National Laboratories, Albuquerque, NM, USA, July 1995.
 M. Juvan and B. Mohar. Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math., 36(2):153168, 1992.
 G. Karypis and V. Kumar. Analysis of multilevel graph partitioning. In Supercomputing 95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), page 29, New York, NY, USA, 1995. ACM.
 G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput., 20(1):359392, 1998.
 G. Karypis and V. Kumar. METIS A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices: Version 4.0. University of Minnesota, Minneapolis, MN, USA, 4.0 edition, September 1998.
 G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph partitioning. In Supercomputing 98: Proceedings of the 1998 ACM/IEEE conference on Supercomputing, pages 113, Washington, DC, USA, 1998. IEEE Computer Society.
 Y. Koren and D. Harel. A multi-scale algorithm for the linear arrangement problem. In WG 02: Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 296309, London, UK, 2002. Springer-Verlag.
 J. Leskovec, K. Lang, A. Dasgupta, and M. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Technical report, University of Stanford, 2008.
 J. Petit. Combining spectral sequencing and parallel simulated annealing for the minla problem. Parallel Processing Letters, 13:2003, 2003.
 J. Petit. Experiments on the minimum linear arrangement problem. J. Exp. Algorithmics, 8, 2003.
 R. Ramakrishnan and J. Gehrke. Database Management Systems. McGraw-Hill, New York, NY, USA, 2002.
 C. Ruemmler and J. Wilkes. An introduction to disk drive modeling. IEEE Computer, 27:1728, 1994.
 I. Safro, D. Ron, and A. Brandt. Graph minimum linear arrangement by multilevel weighted edge contractions. J. Algorithms, 60(1):2441, 2006.
 K. Schloegel, G. Karypis, and V. Kumar. Graph partitioning for high-performance scientific simulations, pages 491541. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2003.