In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes

ACM Journal of Experimental Algorithmics

Volumn 10, Issue , 2005, Pages

  Nikolov, Nikola S ^a,b   Tarassov, Alexandre ^a,b   Branke, Jürgen ^c  

^a UNIVERSITY OF LIMERICK   (Ireland)

^b CSIRO   (Australia)

^c UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Dummy vertices; G.1.1 interpolation ; G.2 approximation ; Hierarchical graph drawing; Layer assignment; Layered graphs; Layering

Indexed keywords

EID: 77951525874     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1064546.1180618     Document Type: Article

References (24)

1. th International Symposium, GD 2005, vol. 3843 of Lecture Notes in Computer Science. Springer-Verlag, New York. 468-479.
2. BRANKE, J., EADES, P., LEPPERT, S., AND MIDDENDORF, M. 2001. Width restricted layering of acyclic digraphs with consideration of dummy nodes. Tech. Rep. No. 403, Intitute AIFB, University of Karlsruhe, 76128 Karlsruhe, Germany.
3. BRANKE, J., LEPPERT, S., MIDDENDORF, M., AND EADES, P. 2002. Width-restricted layering of acyclic digraphs with consideration of dummy nodes. Information Processing Letters 81, 2, 59-63.
4. CARPANO, M. J. 1980. Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Transactions on Systems, Man and Cybernetics 10, 11, 705-715.
5. COFFMAN, E. G. AND GRAHAM, R. L. 1972. Optimal scheduling for two processor systems. Acta Informatica 1, 200-213.
6. DI BATTISTA, G., ENGLEWOOD CLIFFS, N. J., GARG, A., LIOTTA, G., TAMASSIA, R., TASSINARI, E., AND VARGIU, F. 1997. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications 7, 303-316.
7. DI BATTISTA, G., EADES, P., TAMASSIA, R., AND TOLLIS, I. G. 1999. Graph drawing. Prentice Hall.
8. EADES, P., LIN, X., AND SMYTH, W. F. 1993. A fast and effective heuristic for the feedback arc set problem. Information Processing Letters 47, 319-323.
9. EADES, P. AND SUGIYAMA, K. 1990. How to draw a directed graph. Journal of Information Processing 13, 4, 424-437.
10. GANSNER, E. R., KOUTSOFIOS, E., NORTH, S. C., AND VO, K.-P. 1993. A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19, 3, 214-230.
11. th International Symposium, GD 2002, vol. 2528 of Lecture Notes in Computer Science. Springer-Verlag, New York. 98-109.
12. th International Symposium, GD 2001, vol. 2265 of Lecture Notes in Computer Science. Springer-Verlag, New York. 16-30.
13. HU, T. 1961. Parallel sequencing and assembly line problems. Operations Research 9, 841-848.
14. KWOK, Y.-K. AND AHMAD, I. 1999. Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys 31, 4, 406-471, 1999.
15. LEMKE, I. 1994. Entwicklung and Implementierung eines Visualisierungswerkzeuges für Anwendungen im Übersetzerbau. Diplomarbeit, Universität des Saarlandes, FB 14 Informatik.
16. MEHLHORN, K. 1984. Data Structures and Algorithms, Volume 2: Graph Algorithms and NP-Completeness. Springer-Verlag, New York.
17. NEMHAUSER, G. L. AND WOLSEY, L. A. 1988. Integer and Combinatorial Optimization. Wiley, New York.
18. NIKOLOV, N. S. AND TARASSOV, A. 2006. Graph layering by promotion of nodes. Discrete Applied Mathematics, Special Issue Associated with the IV ALIO/EURO Workshop on Applied Combinatorial Optimization. 154, 5, 848-860.
19. SUGIYAMA, K. AND MISUE, K. 1995. Graph drawing by the magneting spring model. Journal of Visual Languages and Computing 6, 3, 217-231.
20. SUGIYAMA, K., TAGAWA, S., AND TODA, M. 1981. Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics 11, 2, 109-125.
21. TARASSOV, A., NIKOLOV, N. S., AND BRANKE, J. 2004. A heuristic for minimum-width of graph layering with consideration of dummy nodes. In Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, vol. 3059 of Lecture Notes in Computer Science. Springer-Verlag, New York. 570-583.
22. ULMAN, J. 1975. NP-complete scheduling problems. Journal of Computer and System Sciences 10, 384-393.
23. UTECH, J., BRANKE, J., SCHMECK, H., AND EADES, P. 1998. An evolutionary algorithm for drawing directed graphs. In Proceedings of the 1998 International Conference on Imaging Science, Systems, and Technology (CISST' 98). 154-160.
24. WARFIELD, J. N. 1977. Crossing theory and hierarchy mapping. IEEE Transactions on Systems, Man and Cybernetics 7, 7, 502-523.