کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
11021209 | 1715030 | 2019 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs Tabu search with graph reduction for finding maximum balanced bicliques in bipartite graphs](/preview/png/11021209.png)
چکیده انگلیسی
The Maximum Balanced Biclique Problem is a relevant graph model with a number of applications in diverse domains. However, the problem is NP-hard and thus computationally challenging. In this paper, we introduce a novel metaheuristic algorithm, which combines an effective constraint-based tabu search procedure and two dedicated graph reduction techniques. We verify the effectiveness of the algorithm on 30 classical random benchmark graphs and 25 very large real-life sparse graphs from the popular Koblenz Network Collection (KONECT). The results show that the algorithm improves the best-known results (new lower bounds) for 10 classical benchmarks and obtains the optimal solutions for 14 KONECT instances.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Engineering Applications of Artificial Intelligence - Volume 77, January 2019, Pages 86-97
Journal: Engineering Applications of Artificial Intelligence - Volume 77, January 2019, Pages 86-97
نویسندگان
Yi Zhou, Jin-Kao Hao,