New heuristic approaches for maximum balanced biclique problem-Reference-Cited by-同舟云学术

New heuristic approaches for maximum balanced biclique problem

Published:2018-03 Issue: Volume:432 Page:362-375
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Wang Yiyuan,Cai Shaowei,Yin Minghao

Funder

National Key Research and Development Program of China

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference28 articles.

1. A defect tolerance scheme for nanotechnology circuits;Al-Yamani;Circuits Syst. I,2007

2. Population-based incremental learning. a method for integrating genetic search based function optimization and competitive learning;Baluja,1994

3. Breakout local search for the vertex separator problem;Benlic,2013

4. Fast solving maximum weight clique problem in massive graphs;Cai,2016

5. New local search methods for partial maxsat;Cai;Artif. Intell.,2016

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A greedy randomized adaptive search procedure (GRASP) for minimum 2-fold connected dominating set problem;Applied Soft Computing;2024-11

2. Maximal size constraint community search over bipartite graphs;Knowledge-Based Systems;2024-08

3. Efficient Index for Temporal Core Queries over Bipartite Graphs;Proceedings of the VLDB Endowment;2024-07

4. Bipartite Graph Analytics: Current Techniques and Future Trends;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

5. Maximal Biclique Enumeration: A Prefix Tree Based Approach;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13