A new meta-method for graph partitioning

2008 IEEE Congress on Evolutionary Computation, CEC 2008

Volumn , Issue , 2008, Pages 3499-3506

  Bichot, Charles Edmond ^a  

^a ENAC   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; FUSION REACTIONS; GRAPH THEORY; IMAGE PROCESSING; IMAGE SEGMENTATION;

AIR TRAFFIC MANAGEMENTS; CLASSICAL METHODS; GRAPH PARTITIONING; NUCLEAR PROCESSES; OF GRAPHS;

AIR TRAFFIC CONTROL;

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

References (30)

1. Stephen T. Barnard and Horst D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6:101-107, 1994.
2. Florence Benezit, Timothee Cour, and Jianbo Shi. Spectral segmentation with multi-scale graph decomposition. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2005.
3. Charles-Edmond Bichot. A metaheuristic based on fusion and fission for partitioning problems. In Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium, 2006.
4. Charles-Edmond Bichot. A new method, the fusion fission, for the relaxed k-way graph partitioning problem, and comparisons with some multilevel algorithms. Journal of Mathematical Modeling and Algorithms (JMMA), 6(3):319-344, 2007.
5. Charles-Edmond Bichot, Jean-Marc Alliot, Nicolas Durand, and Pascal Brisset. Optimisation par fusion et fission, application au problme du dcoupage arien europen. Journal Europen des Systmes Automatiss (JESA), 38(9-10):1141-1173, 2004.
6. Inderjit S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In Proceedings of the ACM International Conference on Knowledge Discovery and Data Mining (KDD), pages 269-274, 2001.
7. Inderjit S. Dhillon. Yuqiang Guan, and Brian Kullis. Kernel k-means, spectral clustering, and normalized cuts. In Proceedings of the 10th ACM International Conference on Knowledge Discovery and Data Mining (KDD), pages 551-556, 2004.
8. Chris Ding, Xiaofeng He, Hongyuan Zha, Ming Gu, and Horst D. Simon. A min-max cut algorithm for graph partitioning and data clustering. In Proceedings of the IEEE International Conference on Data Mining, pages 107-114, 2001.
9. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proceedings of 19th ACM/IEEE Design Automation Conference, pages 175-181, 1982.
10. Yoram Gdalyahu, Daphna Weinshall, and Michael Werman. Selforganization in vision: Stochastic clustering for image segmentation, perceptual grouping, and image database organization. IEEE Transaction on Pattern Analysis and Machine Intelligence, 23(10): 1053-1074, 2001.
11. Anders Hallgren, Restructuring european airspace: functional airspace blocks. Skyway, pages 20-22, autumn 2005.
12. Bruce Hendrickson. Graph partitioning and parallel solvers: Has the emperor no clothes? (extended abstract). In Proceedings of the Workshop on Parallel Algorithms for Irregularly Structured Problems, pages 218-225, 1998,
13. David S. Johnson, Cecilia R. Aragon, Lyle A. McGeoch, and Catherine Schevon. Optimization by simulated annealing: an experimental evaluation; part i, graph partitioning. Operations Research Society of America, 37(6):865-892, 1989.
14. George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs, SIAM Journal of Scientific Computing, 20(1):359-392, 1998.
15. George Karypis and Vipin Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129, 1998.
16. B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291-307. 1970.
17. Aleix M. Martínez, Pradit Mittrapiyanuruk, and Avinash C. Kak. On combining graph-partitioning with non-parametric clustering for image segmentation. Computer Vision and Image Understanding, pages 72-85, 2004.
18. Marina Meila and Jianbo Shi. Learning segmentation by random walks. In Proceedings of the Neural Information Processing Systems, pages 873-879, 2000.
19. Franois Pellegrini. Scotch and libScotch. ENSEIRB - LaBRI, Universit de Bordeaux I, 4.0 edition, jan 2006.
20. P. Perona and W. Freeman. A factorization approach to grouping. In Proceedings of the European Conference on Computer Vision, volume 1406 of Lecture Notes in Computer Science, 1998.
21. Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications, 11(3):430-452, 1990.
22. J. Shi, S. Belongie, T. Leung, and J. Malik. Image and video segmentation: The normalized cut framework. In Proceedings of the IEEE International Conference on Image Processing, pages 943-947, 1998.
23. Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
24. Horst D. Simon and Shang-Hua Teng. How good is recursive bisection? SIAM Journal on Scientific Computing, 18(5): 1436-1445, 1997.
25. Alan J. Soper, Chris Walshaw, and M. Cross. A combined evolutionary search and multilevel optimisation approach to graph-partitioning. Journal of Global Optimization, 29:225-241, 2004.
26. Chris Walshaw and M. Cross. Mesh partitioning: A multilevel balancing and refinement algorithm. SIAM Journal on Scientific Computing, 22:63-80, 2000.
27. Song Wang and Jeffrey Mark Siskind. Image segmentation with minimum mean cut. In Proceedings of the IEEE International Conference on Computer Vision, pages 517-524, 2001.
28. Elie Yarack. An evaluation of move-based multi-way partitioning algorithms. In Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors, page 363, 2000.
29. Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming Gu, and Horst D. Simon. Bipartite graph partitioning and data clustering. In ACM Conference on Information and Knowledge Management, pages 25-32, 2001.
30. Ying Zhao and George Karypis. Empirical and theoretical comparisons of selected criterion functions for document clustering. Machine Learning, 55(3):311-331, 2004.