Finding Maximum Edge Bicliques in Convex Bipartite Graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

Published:2011-01-06 Issue:2 Volume:64 Page:311-325
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Nussbaum Doron,Pu Shuye,Sack Jörg-Rüdiger,Uno Takeaki,Zarrabi-Zadeh Hamid

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-010-9486-x.pdf

Reference32 articles.

1. Aggarwal, A., Klawe, M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2(1–4), 195–208 (1987)

2. Alexe, G., Alexe, S., Crama, Y., Foldes, S., Hammer, P.L., Simeone, B.: Consensus algorithms for the generation of all maximal bicliques. Discrete Appl. Math. 145(1), 11–21 (2004)

3. Ben-Dor, A., Chor, B., Karp, R., Yakhini, Z.: Discovering local structure in gene expression data: the order-preserving submatrix problem. J. Comput. Biol. 10(3–4), 373–384 (2003)

4. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335–379 (1976)

5. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)

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

1. Persistent Community Search Over Temporal Bipartite Graphs;Advanced Data Mining and Applications;2023

2. Efficient maximal biclique enumeration for large sparse bipartite graphs;Proceedings of the VLDB Endowment;2022-04

3. CSS on Bipartite Networks;Cohesive Subgraph Search Over Large Heterogeneous Information Networks;2022

4. The Bipartite QUBO;The Quadratic Unconstrained Binary Optimization Problem;2022

5. Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs;Proceedings of the 2021 International Conference on Management of Data;2021-06-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3