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


KIPS Transactions on Software and Data Engineering, Vol. 3, No. 3, pp. 119-124, Mar. 2014
10.3745/KTSDE.2014.3.3.119,   PDF Download:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. H. Han and C. S. Kim, "Study for the Maximum Bipartite Subgraph Problem Using GRASP + Tabu Search," KIPS Transactions on Software and Data Engineering, vol. 3, no. 3, pp. 119-124, 2014. DOI: 10.3745/KTSDE.2014.3.3.119.

[ACM Style]
Keun Hee Han and Chan Soo Kim. 2014. Study for the Maximum Bipartite Subgraph Problem Using GRASP + Tabu Search. KIPS Transactions on Software and Data Engineering, 3, 3, (2014), 119-124. DOI: 10.3745/KTSDE.2014.3.3.119.