2010•Journal of the University of Shanghai for Science and TechnologyRequires access
Bipartite graph identification using genetic algorithm
Zhang Ning
Open publisher page 0 citations
Abstract
In order to reduce the time complexity,genetic algorithm was used to identify bipartite graphs.The nodes of graph G were allocated into two communities randomly;and then genetic algorithm was taken to optimize the modularity function Q.When obtaining the minimum value of Q and sitting all the edges between the two communities,graph G is a bipartite graph.Its accuracy was tested with an example.