Stochastic heuristic for visualizing graph clusters in a bi-dimensional space prior to partitioning

Journal of Heuristics

Volumn 5, Issue 3, 1999, Pages 327-351

  Kuntz, Pascale ^a   Snyers, Dominique ^b   Layzell, Paul ^c  

^a UNIVERSITÉ DE NANTES   (France)

^b ECOLE DES MINES DE NANTES   (France)

^c UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; RANDOM PROCESSES;

GRAPH CLUSTERS; STOCHASTIC HEURISTIC;

HEURISTIC METHODS;

EID: 0033347836     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009665701840     Document Type: Article

References (38)

1. Alpert, C. and A. Kahng. (1993). "Geometric Embeddings for Faster and Better Multiway Netlist Partitioning." 30th Design Automation Conference. ACM/IEEE, pp. 743-748.
2. Alpert, C. and A. Kahng. (1995). "Recent Directions in Netlist Partitioning: a Survey," Integration 19, 1-81.
3. Alpert, C. and A. Kahng. (1997). "Splitting Orderings in Multi-Way Partitioning to Minimize the Minimum Diameter," Journal of Classification 14, 51-74.
4. Bandelt, H.-J., V. Chepoi, andM. Laurent. (1998). "Embedding into Rectilinear Spaces," Discrete of Computational Geometry 19(4), 595-604.
5. Barnes, E. (1982). "An Algorithm for Partitioning the Nodes of a Graph," SIAM J. Algebraic Discrete Methods 3(4), 541-550.
6. Barra, J., M. Becker, E. Kouka, and M. Tricot. (1987). "Application of Data Analysis Methods and of Simulated Annealing for the Automatic Layout of Circuits," Computer Systems Science and Engineering 2(1), 12-21.
7. Barra, J., M. Becker, E. Kouka, and J. Tsitsimis. (1984). "Factorial Analysis of Data Stochastic Method for Automatic Layout of Circuits." SIAM Congress, Boston.
8. Bonabeau, E. (1994). In: Hermes, Paris, chap. 8, pp. 221-261. E. Bonabeau and G. Theraulaz (eds.), Collective Intelligence (in french).
9. Bonabeau, E., M. Dorigo, and G. Theraulaz. (1998). From Natural to Artificial Swarm Intelligence. Oxford Univ. Press, to appear.
10. Buckley, F. and F. Harary. (1990). Distance in Graphs. Toronto: Addison-Wesley.
11. Bui, T., S. Chaudhuri, F. Leighton, and M. Sipser. (1987). "Graph Bisection Algorithms with Good Average Case Behavior," Combinatorica 7(2), 171-191.
12. Caillez, F. and P. Kuntz. (1996). "Contribution to the Study of the Metric and Euclidian Structures of Dissimilarity," Psychometrika 61, 241-253.
13. Coffman, E., P. Courtois, E. Gilbert, and P. Piret. (1991). "A Distributed Clustering Process," Journal of Applied Probability 28, 737-750.
14. Dalhaus, E., D. Johnson, C. Papadimitriu, P. Seymour, and Yanakakis. (1983). "The Complexity of the Multiway Cuts." Private communication.
15. n for Effective Partitioning," Algorithms Review 2(3), 105-112.
16. Deneubourg, J., S. Goss, N. Franks, A. Sendova-franks, C. Detrain, and L. Chretien. (1990). "The Dynamics of Collective Sorting: Robot-Like Ants and Ant-Like Robots." 1st Int. Conf. on Simulation of Adaptative Behaviour: From Animals to Animats. Paris, pp. 356-363.
17. Dice, L. (1995). "Measures of the Amount of Ecologic Association Between Species," Ecologie 26, 297-302.
18. 1-norm and Related Methods. Elsevier Science, 185-193.
19. Fiduccia, C. and M. Mattheyses. (1982). "A Linear Time Heuristic for Improving Network Partitions." Proc. of the ACM/IEEE 19th Design Automation Conference. pp. 175-181.
20. Garbers, J., H. Promel, and A. Steger. (1990). "Finding Clusters in VLSI Circuits." IEEE Int. Conf. on Computer-Aided Design, pp. 520-523.
21. Garey, M., D. Johnson, and L. Stockmeyer. (1976). "Some Simplified script N signP-Complete Graph Problems," Theoretical Computer Science 1, 237-267.
22. Goldschmidt, O. and D. Hochbaum. (1987). "A Polynomial Algorithm for the k-cut Problem." School of Business Administration, University of California, Berkeley, CA.
23. Gower, C. and P. Legendre. (1984). "Metric and Euclidean Properties of Dissimilarity Coefficients," Journal of Classification 3, 5-48.
24. Hagen, L. and A. Kahng. (1992). "A New Approach to Effective Circuit Clustering." IEEE International Conference on Computer-Aided Design. Santa Clara, pp. 422-427.
25. Hall, K. (1970). "An r-Dimensional Quadratic Placement Algorithm," Management Sci. 17, 219-229.
26. Hendrickson, B. and R. Leland. (1995). "The Chaco User's Guide: Version 2.0." Technical Report SANS94-2692, Sandia National Laboratories, Albuquerque, July 1995.
27. Hubert, L. and P. Arabie. (1992). "Multidimensional Scaling in the City-Block Metric; a Combinatorial Approach," Journal of Classification 9, 211-236.
28. Jouve, B., P. Rosenstiehl, and M. Imbert. (1998). "A Mathematical Approach to the Connectivity Between the Cortical Areas of the Macaque Monkey," Cerebral Cortex 8, 28-39.
29. Kernighan, B. and S. Lin. (1970). "An Efficient Heuristic Procedure for Partitioning Graphs," Bell System Technical Journal 49, 291-307.
30. Krishnamurthy, B. (1984). "An Improved Min-Cut Algorithm for Partitioning VLSI Networks," IEEE Trans. on Computer C-33(5), 438-446.
31. Kuntz, P. (1992). "Euclidean Representation of an Abstract Graph for its Partitioning." Ph.D. Thesis, E.H.E.S.S., Paris.
32. Lagognotte, P. (1991). "The Different Electrical Distances (in French)," Revue Générale de l'Electricité 7, 5-10.
33. Lengauert, T. (1990). Combinatorial Algorithms for Integrated Circuit Layout. London: John Wiley.
34. Lumer, E. and B. Faieta. (1994). "Diversity and Adaptation in Populations of Clustering Ants." Third Conf. on Simulation of Adaptative Behaviour. Brighton: MIT Press, pp. 499-508.
35. Mohar, B. and S. Poljak. (1992). "Eigenvalues in Combinatorial Optimization." Technical Report 30, 371, University of Ljubljana, Department of Mathematics, Slovenia.
36. Sait, S. and H. Youssef. (1995). VLSI Physical Design Automation: Theory and Practice. IEEE Press and Mc Graw-Hill.
37. Simmen, M., G. Goodhill, and D. Wilishaw. (1994). "Scaling and Brain Connectivity," Nature 369, 448-450.
38. Torgerson, W. (1958). Theory and Methods of Scaling. J. Wiley & Sons.