Finding maximum edge bicliques in convex bipartite graphs

被引：0
|
作者：
Nussbaum, Doron [1 ]
Pu, Shuye [2 ]
Sack, Jörg-Rüdiger [1 ]
Uno, Takeaki [3 ]
Zarrabi-Zadeh, Hamid [1 ]
机构：
[1] School of Computer Science, Carleton University, Ottawa, ON K1S 5B6, Canada
[2] Program in Molecular Structure and Function, Hospital for Sick Children, 555 University Avenue, Toronto, ON M5G 1X8, Canada
[3] National Institute of Informatics, 2-1-2 Hitotsubashi, Tokyo, Chiyoda-ku 101-8430, Japan
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2010年 / 6196 LNCS卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graph theory
引用
收藏
页码：140 / 149
相关论文
共 50 条
  • [21] Coarse grained parallel maximum matching in convex bipartite graphs
    Bose, P.
    Chan, A.
    Dehne, F.
    Latzel, M.
    Proceedings of the International Parallel Processing Symposium, IPPS, 1999, : 125 - 129
  • [22] Improved binary linear programming models for finding maximum edge Bi-clique in bipartite graphs
    Ghadiri, Mohammad Javad
    Bagherian, Mehri
    JOURNAL OF SUPERCOMPUTING, 2025, 81 (01):
  • [23] On edge-sets of bicliques in graphs
    Groshaus, Marina
    Hell, Pavol
    Stacho, Juraj
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2698 - 2708
  • [24] FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS
    TSENG, FSC
    YANG, WP
    CHEN, ALP
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1993, 25 (05) : 65 - 71
  • [25] On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types
    Zhang, Yun
    Phillips, Charles A.
    Rogers, Gary L.
    Baker, Erich J.
    Chesler, Elissa J.
    Langston, Michael A.
    BMC BIOINFORMATICS, 2014, 15
  • [26] On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types
    Yun Zhang
    Charles A Phillips
    Gary L Rogers
    Erich J Baker
    Elissa J Chesler
    Michael A Langston
    BMC Bioinformatics, 15
  • [27] Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming
    Sozdinler, Melih
    Ozturan, Can
    2018 21ST IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE 2018), 2018, : 132 - 137
  • [28] On maximum k-edge-colorable subgraphs of bipartite graphs
    Karapetyan, Liana
    Mkrtchyan, Vahan
    DISCRETE APPLIED MATHEMATICS, 2019, 257 : 226 - 232
  • [29] Computing maximum non-crossing matching in convex bipartite graphs
    Chen, Danny Z.
    Liu, Xiaomin
    Wang, Haitao
    DISCRETE APPLIED MATHEMATICS, 2015, 187 : 50 - 60
  • [30] Coarse grained parallel maximum independent set in convex bipartite graphs
    Soares, J
    Stefanes, MA
    PDPTA'2001: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, 2001, : 527 - 533
12345