New results on an ant-based heuristic for highlighting the organization of large graphs

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 2, Issue , 1999, Pages 1451-1458

  Kuntz, Pascale ^a   Snyers, Dominique ^b  

^a IRESTEIRIN   (France)

^b ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY ALGORITHMS;

CLASSICAL APPROACH; CONNECTED GRAPH; GRAPH VISUALIZATION; LARGE GRAPHS; METRIC SPACES; MULTI-DIMENSIONAL SCALING; NEW RESULTS; TWO-DIMENSIONAL GRIDS;

COMPUTER SCIENCE;

EID: 84901470600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.782654     Document Type: Conference Paper

References (25)

1. V. Fayyad, G. Piatetsky-Shapiro, P. Smith, and R. Uthurusamy, Advances in Knowledge Discovery and Data Mining. Menlo Park: The AIII Press, 1996.
2. G. D. Battista, P. Eades, R. Tamassia, and I.-G. Bandelt, Graph drawing. Algorithms for the visualization of graphs. New Jersey: Prentice Hall, 1999.
3. H. Purchase, R. Cohen, and M. James, "Validating graph drawing aesthetics", in Proceedings of graph Drawing'95 (F. Brandenburg, ed.), vol. 1027 of Lecture notes in Computing Science, pp. 435-446, 1996.
4. M. Littman, D. Swayne, N. Dean, and A. Buja, "Visualizing the embedding of objects in euclidian space", in Computing Science and Statistics: proc of the 24th symposium on interfaces, pp. 298-217, 1992.
5. H.-J. Bandelt, V. Chepoi, and M. Laurent, "Embedding into rectilinear spaces", Discrete Computational Geometry, vol. 19, no. 4, pp. 595-604, 1998.
6. Avis and Deza, "The cut cone 11 embeddability, complexity and multicommodity flows", Networks, vol. 21, pp. 595-617, 1991.
7. Malitz and Malitz, "A bounded compactness theorem for 11-embeddability of metric spaces in the plane", Discrete Computational Geometry, vol. 8, pp. 373-385, 1992.
8. L. M. Blumenthal, Theory and application of distance geometry. London: Oxford University Press, 1953.
9. M. Grotschel, L. Lovasz, and A. Schrijver, Geometric algorithms and combinatorial optimization. Springer Verlag, 1988.
10. Y. Dodge, "Ll-statistical analysis and related methods", Amsterdam: Elsevier Science Publishers, 1992.
11. F. Caillez and P. Kuntz, "Contribution to the study of the metric and euclidian structures of dissimilarity", Psychometrika, vol. 61, pp. 241-253, June 1996.
12. A. Buja, N. Dean, M. Littman, and D. Swayne, "Higher dimensional representations of graphs", Tech. Rep. 95-47, DIMACS, Piscataway, NJ, 1995.
13. P. Kuntz, D. Snyers, and P. Layzell, "A stochastic heuristic for visualising graph clusters in a bidimensional space prior to partitioning", Journal of heuristics, vol. 5, no. 3, 1999. (To appear.).
14. E. Bonabeau, M. Dorigo, and G. Theraulaz, From natural to artificial swarm intelligence. Oxford University Press, 1999.
15. D. Swayne, D. Cook, and A. Buja, "Xgobi: Interactive dynamic data visualization in the x window system", Journal of Computational and Graphical Statistics, vol. 7, pp. 125-140, 1998.
16. J. Deneubourg, S. Goss, N. Franks, A. Sendova-Franks, C. Detrain, and L. Chretien, "The dynamics of collective sorting: robot-like ants and ant-like robots", in 1st Int. Conf. on Simulation of Adaptative Behaviour: From Animals to Animats, pp. 356-363, 1990.
17. E. Lumer and B. Faieta, "Diversity and adaptation in populations of clustering ants", in Third Conf. on Simulation of Adaptative Behaviour, pp. 499-508, MIT Press, 1994.
18. F. Young, "Multidimensional scaling", in Encyclopedia of Statistical Sciences (Kotz-Johnson, ed.), vol. 5, 1985.
19. G. Young and A. Householder, "Discussion of a set of points in terms of their mutual distances", Psychometrika, vol. 3, pp. 19-22, 1938.
20. W. Torgerson, Theory and methods of scaling. J. Wiley & Sons, 1958.
21. R. Shepard, "The analysis of proximities; multidimensional scaling with an unknown distance function", Psychometrika, vol. 27, pp. 125-140, 1962.
22. J. Kruskal and M. Wish, Multidimensional Scaling, vol. 07-001 of Sage University paper series on Quantitative Application in Social Sciences. London: Sage Publications, 1964.
23. J. Garbers, H. Promel, and A. Steger, "Finding clusters in VLSI circuits", in IEEE Int. Conf. on Computer-Aided Design, pp. 520-523, 1990.
24. L. Hubert and P. Arabie, "Multidimensional scaling in the city-block metric; a combinatorial approach", Journal of Classification, vol. 9, pp. 211-236, 1992.
25. M. Heusse, S. Guerin, D. Snyers, and P. Kuntz, "Adaptive agent-driven routing and load balancing in communication networks", Journal of Advances in Complex Systems, no. 1, pp. 237-254, 1999.