Removing node overlapping in graph layout using constrained optimization

Constraints

Volumn 8, Issue 2, 2003, Pages 143-171

  Marriott, Kim ^a   Stuckey, Peter ^b   Tam, Vincent ^c   He, Weiqing ^a  

^a MONASH UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Constrained optimization; Disjunctive constraints; Graph layout

Indexed keywords

ALGORITHMS; GLOBAL OPTIMIZATION; GRAPH THEORY; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

NODE OVERLAPPING;

CONSTRAINT THEORY;

EID: 0037382018     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022371615202     Document Type: Article

References (29)

1. Aarts, E. H. L., & Korst, J. H. M. (1989). Boltzmann machines for traveling salesman problems. European Journal of Operational Research, 39: 79-95.
2. Adorf, H., & Johnston, M. (1990). A discrete stochastic neural network algorithm for constraint satisfaction problems. In Proceedings of the International Joint Conference on Neural Networks, pages 917-924.
3. Böhringer, K., & Paulisch, F. N. (1990). Using constraints to achieve stability in automatic graph layout algorithms. In CHI'90 Proceedings, pages 43-51, ACM.
4. Borning, A., Marriott, K., Stuckey, P., & Xiao, Y. (1997). Solving linear arithmetic constraints for user interface applications. In Proceedings of the 1997 ACM Symposium on User Interface Software and Technology, pages 87-96.
5. Davenport, A., Tsang, E. P. K., Wang, C. J., & Zhu, K. (1994). GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. In Proceedings of AAAI'94, pages 325-330.
6. di Battista, T., Eades, P., Tamassia, R., & Tollis, I. G. (1999). Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall.
7. Dozier, G., Bowen, J., & Bahler, D. (1994). Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation, pages 306-311.
8. Eades, P., Lai, W., Misue, K., & Sugiyama, K. (1991). Preserving the mental map of a diagram. Technical Report IIAS-RR-91-16E, International Institute for Advanced Study of Social Information Science, Fujitsu Laboratories Ltd.
9. He, W., & Marriott, K. (1998). Removing node overlapping using constrained optimization. In Australasian Computer Science Conference, pages 169-180, Springer-Verlag.
10. Huang, M. L., Eades, P., & Wang, J. (1998). On-line animated visualization of huge graphs using a modified spring algorithm. Journal of Visual Languages and Computing, 9: 623-645.
11. Lee, J. H. M., Leung, H. F., & Won, H. W. (1995). Extending GENET for non-binary CSP's. In Proceedings of Seventh International Conference on Tools with Artificial Intelligence, pages 338-343.
12. Lee, J. H. M., Leung, H. F., & Won, H. W (1996). Towards a more efficient stochastic constraint solver. In Proceedings of Principles and Practice of Constraint Programming (CP96), LNCS 1118, pages 338-352.
13. Leunberger, D. G. (1994). Linear and Nonlinear Programming. Addison-Wesley Publishing Company.
14. Lüders, P., Ernst, R., & Stille, S. (1995). An approach to automatic display layout using combinatorial optimization. Software-Practice and Experience, 25(11): 1183-1202.
15. Lyons, K. A. (1996). Cluster busting in anchored graph drawing. Ph.D. thesis, Department of Computing & Information Science Queen's University.
16. Mackworth, A. K. (1997). Consistency in networks of relations. AI Journal, 8(1): 99-118.
17. Minton, S., Johnston, M. D., Phillips, A. B., & Laird, P. (1992). Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58: 161-205.
18. Misue, K., Eades, P., Lai, W., & Sugiyama, K. (1995). Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6: 183-210.
19. Papakostas, A., Six, J. M., & Tollis, I. G. (1997). Experimental and theoretical results in interactive orthogonal graph drawing. In Proceedings of International Symposium on Graph Drawing, CD'96, LNCS 1190, pages 371-386, New York:Springer.
20. Paulisch, F. N., & Tichy, W. F. (1990). Edge: an extendible graph editor. Software - Practice and Experience, 20(S1): 63-88.
21. Simmons, D. M. (1975). Nonlinear Programming for Operations Research. Englewood Cliffs, NJ: Prentice-Hall.
22. Storey, M. D., & Müller, H. A. (1995). Graph layout adjustment strategies. In Symposium on Graph Drawing, CD'95, LNCS 1027, pages 487-499, Springer-Verlag.
23. Tsang, E. (1993). Foundations of Constraint Satisfaction. Academic Press.
24. Voudoris, C., & Tsang, E., (1999). Guided local search and its application to the travelling saleman problem. European Journal of Operational Research, 11(2): 469-499.
25. Voudouris, C. (1997). Guided local search for combinatorial optimization problems. Ph.D. thesis, Department of Computer Science, University of Essex.
26. Voudouris, C., & Tsang, E. (1996). Partial constraint satisfaction problems and guided local search. In Proceedings of Practical Application of Constraint Technology, PACT96, pages 337-356.
27. Voudouris, C., & Tsang, E. (1999). Guided local search and its application to the traveling salesman problem. European Journal of Operational Research, 113: 469-499.
28. Walsh, G. R. (1975). Methods of Optimization. John Wiley and Sons.
29. Wang, C., & Tsang, E. (1991). Solving satisfaction problems using neural-networks. In Proceedings of IEE Second International Conference on Artificial Neural Networks, pages 295-299.