Art

J-GLOBAL ID：200902215525013900   Reference number：09A1005705

Solving the Bipartite Subgraph Problem Using Genetic Algorithm with Conditional Genetic Operators

条件的遺伝的操作を行う遺伝的アルゴリズムを用いた2部部分グラフ問題の求解

Author (3)： CHEN Zhi-Qiang (Univ. Fukui, Fukui-shi, JPN) ,  WANG Rong-Long (Univ. Fukui, Fukui-shi, JPN) ,  OKAZAKI Kozo (Univ. Fukui, Fukui-shi, JPN)
Material： IEEJ Transactions on Electrical and Electronic Engineering  (IEEJ Trans Electr Electron Eng)
Volume： 4  Issue： 5  Page： 663-667  Publication year： Sep. 2009 
JST Material Number： W1854A  ISSN： 1931-4973  Document type： Article
Article type： 原著論文  Country of issue： United States (USA)  Language： ENGLISH (EN)

Thesaurus term： conditioning ,  constraint condition (restriction) ,  genetic algorithm ,  *subgraph ,  *graph theory ,  *combinatorial optimization problem ,  analytical solution ,  *NP complete problem ,  evolutionary computation

JST classification (1)： Mathematical programmings  (KA03030M)

Reference (22)：

• ASRATIAN, AS. Bipartite Graphs and their Applications. 1998, 1
• GAREY, MR. Some simplified NP-complete graph problem. Theoretical Computer Science. 1976, 1, 237-267
• KARP, RM. Reducibility Among Combinatorial Problems. Complexity of Computer Computations. 1972, 85-104
• EVEN, S. NP-completeness of Several Arrangement Problems. 1975
• BONDY, JA. Largest bipartite subgraph in triangle-free graphs with maximum degree three. Journal of Graph Theory. 1986, 10, 477-504

Terms in the title (4)： 遺伝的アルゴリズム ,  部分グラフ ,  問題 ,  求解