|
[1] J. M. Six and I. Y. G. Tollis, “A framework for user-grouped circular drawings.,” in Graph Drawing (G. Liotta, ed.), vol. 2912, pp. 135–146, Springer Berlin Heidelberg, 2004.
[2] U. B. Michael Baur, “Multi-circular layout of micro/macro graphs,” in Graph Drawing (W. Q. Seok-Hee Hong, Takao Nishizeki, ed.), vol. 4875, pp. 255–267, Springer Berlin Heidelberg, 2008.
[3] S. Lombardy, Y. Regis-Gianas, and J. Sakarovitch, “Introducing Vaucanson,” Theoretical Computer Science, vol. 328, pp. 77 – 96, 2004.
[4] “Vaucanson.”http://www.vaucanson-project.org/.
[5] M. Garey, D. Johnson, and L. Stockmeyer, “Some simplified np-complete graph problems,” Theoretical Computer Science, vol. 1, no. 3, pp. 237 – 267, 1976.
[6] C. Papadimitriou, “The np-completeness of the bandwidth minimization problem,” Computing, vol. 16, no. 3, pp. 263–270, 1976.
[7] V. Dujmović and D. R. Wood, “On linear layouts of graphs,” Discrete Mathematics and Theoretical Computer Science, vol. 6, pp. 339–358, 2004.
[8] K. N. S. Masuda, T. Kashiwabara and T. Fujisawa, “On the np- completeness of a computer network layout problem,” in Proc. IEEE Intl. Symp. Circuits and Systems, pp. 292–295, 1987.
[9] M. Baur and U. Brandes, “Crossing reduction in circular layouts,” in Proc. Workshop on Graph-Theoretic Concpets in Computer Science, vol. 3353, pp. 332–343, Springer, 2004.
|