1. Adolphson, D., Hu, T.C.: Optimal linear ordering. SIAM J. Appl. Math. 25, 403–423 (1973)
2. Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graphs arrangements. In: Proceedings of FOCS 1996, pp. 21–30. IEEE, Los Alamitos (1996)
3. Lecture Notes in Computer Science;G. Blin,2005
4. Botafogo, R.A.: Cluster analysis for hypertext systems. In: Proceedings of SIGIR 1993, pp. 116–125. ACM, New York (1993)
5. Brandstädt, A., Le, V.B., Spinrad, J.: Graph Classes: A Survey. SIAM, Philadelphia (1999)