{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1515056452',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://www.manongdao.com/data/attach/logo/logo.png', '推荐 女痞 的问题《Finding Maximal Bicliques》','https://www.manongdao.com/q-1359274.html','页面编码gb2312|utf-8默认gb2312'));){kind=link}
I have a problem that I was able to model as finding maximal bicliques (complete bipartite graphs) in a bipartite graph. I am aware of the Bron–Kerbosch algorithm for detecting maximal cliques, and it seems to me that there should be a way to express a biclique problem as a clique one. Does anyone have a solution, either for forming a biclique problem as a clique one, or as an available algorithm for detecting bicliques directly?
相关问题
- Finding k smallest elements in a min heap - worst-
- binary search tree path list
- High cost encryption but less cost decryption
- How to get a fixed number of evenly spaced points
- Space complexity of validation of a binary search
相关文章
- What are the problems associated to Best First Sea
- Coin change DP solution to keep track of coins
- Algorithm for partially filling a polygonal mesh
- Robust polygon normal calculation
- Algorithm for maximizing coverage of rectangular a
- How to measure complexity of a string?
- Select unique/deduplication in SSE/AVX
- How to smooth the blocks of a 3D voxel world?
There is a faster algorithm by Nagarajan, Kingsford "Uncovering genomic reassortments among Influenza strains by enumerating maximal bicliques" that runs in
O(n^2).There's the following implementation of maximal biclique enumeration algorithm from Consensus algorithms for the generation of all maximal bicliques by Alexe et.al..
The theoretical running time is
O(Bn^3)whereBis the number of maximal bicliques.