Information Technology Reference
In-Depth Information
4Conluion
We have introduced the problem of drawing aheavysubgraph in a prescribed area.
Both for general graphs withoutfurther constraints and for calculation graphs, we have
developed and tested heuristics which yield quite nice results.
Acknowledgement.
We thank Martin Hennecke for introducing the problem of drawing
calculation graphs to us and for providingus with input data.
References
1. Java Universal Network/Graph Framework (JUNG),
http://www.jung.sourceforge.net
2. Aulbach, M., Fink, M., Schuhmann, J., Wolff, A.: Drawinggraphs within restricted area.
CoRR (2014), ArXiv e-print
http://arxiv.org/abs/1409.0499
3. Bertault, F.: A force-directed algorithm that preserves edge crossing properties. Inf. Proc.
Letters 74(1-2), 7-13 (2000)
4. Coffman, E.G., Graham, R.L.: Optimal scheduling for two-processor systems. Acta In-
form. 1(3), 200-213 (1972)
5. Da Lozzo, G., Di Battista, G., Ingrassia, F.: Drawinggraphs on a smartphone. J. Graph Algo-
rithms Appl. 16(1), 109-126 (2012)
6. Duncan, C.A., Gutwenger, C., Nachmanson, L., Sander, G.: Graph drawing contest report.
In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 575-579. Springer,
Heidelberg (2013)
7. Dwyer, T., Marriott, K., Schreiber, F., Stuckey, P., Woodward, M., Wybrow, M.: Exploration
of networks using overview+detail with constraint-based cooperative layout. IEEE Trans. Vis.
Comput. Graph. 14(6), 1293-1300 (2008)
8. Dwyer, T., Koren, Y., Marriott, K.: IPSep-CoLa: An incremental procedure for separation
constraint layoutofgraphs. IEEE Trans. Vis. Comput. Graph. 12(5), 821-828 (2006)
9. Dwyer, T., Marriott, K., Wybrow, M.: Topology preserving constrained graph layout. In: Tol-
lis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 230-241. Springer, Heidelberg
(2009)
10. Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw.
Pract. Exper. 21(11), 1129-1164 (1991)
11. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9),
1563-1581 (1966)
12. He, W., Marriott, K.: Constrained graph layout. Constraints 3(4), 289-314 (1998)
13. Hennecke, M.: Rechengraphen. Math. Didact. 30(1), 68-96 (2007)
14. Patrignani, M.: On the complexity of orthogonal compaction. Comput. Geom. Theory
Appl. 19(1), 47-67 (2001)
15. Sander, G.: A fast heuristic for hierarchical Manhattan layout. In: Brandenburg, F.J. (ed.) GD
1995. LNCS, vol. 1027, pp. 447-458. Springer, Heidelberg (1996)
16. Simonetto, P., Archambault, D., Auber, D., Bourqui, R.: ImPrEd: An improved force-
directed algorithm that prevents nodes from crossing edges. Comput. Graphics Forum 30(3),
1071-1080 (2011)
17. Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system
structures. IEEE Trans. Syst. Man Cyber. 11(2), 109-125 (1981)
