Browse > Article
http://dx.doi.org/10.3745/KTSDE.2014.3.3.119

Study for the Maximum Bipartite Subgraph Problem Using GRASP + Tabu Search  

Han, Keunhee (공주대학교 응용수학과)
Kim, Chansoo (공주대학교 응용수학과)
Publication Information
KIPS Transactions on Software and Data Engineering / v.3, no.3, 2014 , pp. 119-124 More about this Journal
Abstract
Let G = (V, E) be a graph. Maximum Bipartite Subgraph Problem is to convert a graph G into a bipartite graph by removing minimum number of edges. This problem belongs to NP-complete; hence, in this research, we are suggesting a new metaheuristic algorithm which combines Tabu search and GRASP.
Keywords
Graph; Bipartite Graph; Maximum Bipartite Subgraph Problem; Tabu Search; GRASP;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Kuo Chun Lee, Nobuo Funabiki, and Yoshiyasu Takefuji, "A parallel improvement algorithm for the bipartite subgraph problem", IEEE Transactions on Neural Networks, Vol.3, No.1, pp.139-145, 1992.   DOI
2 S. Even and Y. Shiloach, "NP-completeness of several arrangement problems," Dept. Computer Science, Technion, Haifa, Israel, Tech. Rep. 43, 1975.
3 M. R. Garey, D. S. Johnson, and L. J. Stockmeyer, "Some simplified NP-complete graph problems," Theoretical Computer Science, Vol.1, pp.237-267, 1976.   DOI   ScienceOn
4 J. A. Bondy and S. C. Locke, "Largest bipartite subgraph in triangle-free graphs with maximum degree three," J. Graph Theory, Vol.10, pp.477-504, 1986.   DOI
5 Rong Long Wang, Zheng Tang, and Qi Ping Cao, "A hopfield network learning method for bipartite subgraph problem", IEEE Transactions on Neural Networks, Vol.15, No.6, 2004.
6 Fred Glover, "Future paths for integer programming and links to artificial intelligence", Computers and Operations Research 13(5), pp.533-549, 1986.   DOI   ScienceOn
7 T.A. Feo and M.G.C. Resende, "A probabilistic heuristic for a computationally difficult set covering problem", Operations Research Letters, 8, pp.67-71, 1989.   DOI   ScienceOn
8 R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations. New York: Plenum, pp.85-104. 1972.
9 DIMACS: http://dimacs.rutgers.edu/Challenges/
10 P. Festa, P. M. Pardalos, M. G. C. Resende, and C. C. Ribeiro, "Randomized heuristics for the max-cut problem," Optimization Methods and Software, 7, pp.1033-1058, 2002.
11 SteinLab: http://steinlib.zib.de/steinlib.php
12 I. Rosseti, M. P. de Aragão, C. C. Ribeiro, E. Uchoa, and R. F. Werneck, New benchmark instances for the steiner problem in graphs, In Extended Abstracts of the 4th Metaheuristics International Conference, pp.557-561, Proto, Portugal, 2001.