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 条
  • [1] Finding Maximum Edge Bicliques in Convex Bipartite Graphs
    Nussbaum, Doron
    Pu, Shuye
    Sack, Joerg-Ruediger
    Uno, Takeaki
    Zarrabi-Zadeh, Hamid
    ALGORITHMICA, 2012, 64 (02) : 311 - 325
  • [2] Finding Maximum Edge Bicliques in Convex Bipartite Graphs
    Nussbaum, Doron
    Pu, Shuye
    Sack, Joerg-Ruediger
    Uno, Takeaki
    Zarrabi-Zadeh, Hamid
    COMPUTING AND COMBINATORICS, 2010, 6196 : 140 - +
  • [3] Finding Maximum Edge Bicliques in Convex Bipartite Graphs
    Doron Nussbaum
    Shuye Pu
    Jörg-Rüdiger Sack
    Takeaki Uno
    Hamid Zarrabi-Zadeh
    Algorithmica, 2012, 64 : 311 - 325
  • [4] Maximum Edge Bicliques in Tree Convex Bipartite Graphs
    Chen, Hao
    Liu, Tian
    FRONTIERS IN ALGORITHMICS, FAW 2017, 2017, 10336 : 47 - 55
  • [5] Tabu search with graph reduction for finding maximum balanced bicliques hock for in bipartite graphs
    Zhou, Yi
    Hao, Jin-Kao
    ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2019, 77 : 86 - 97
  • [6] EFFICIENT ALGORITHMS FOR FINDING MAXIMUM MATCHINGS IN CONVEX BIPARTITE GRAPHS AND RELATED PROBLEMS
    LIPSKI, W
    PREPARATA, FP
    ACTA INFORMATICA, 1981, 15 (04) : 329 - 346
  • [7] FINDING MAXIMUM MATCHING FOR BIPARTITE GRAPHS IN PARALLEL
    CHAUDHURI, P
    OPERATIONS RESEARCH LETTERS, 1994, 16 (01) : 47 - 49
  • [8] Identifying Similar-Bicliques in Bipartite Graphs
    Yao, Kai
    Chang, Lijun
    Yu, Jeffrey Xu
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2022, 15 (11): : 3085 - 3097
  • [9] On finding convex cuts in general, bipartite and plane graphs
    Glantz, Roland
    Meyerhenke, Henning
    THEORETICAL COMPUTER SCIENCE, 2017, 695 : 54 - 73
  • [10] Parallel maximum independent set in convex bipartite graphs
    Czumaj, A
    Diks, K
    Przytycka, TM
    INFORMATION PROCESSING LETTERS, 1996, 59 (06) : 289 - 294
12345