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 条
  • [31] Finding maximal bicliques in bipartite networks using node similarity
    Taher Alzahrani
    Kathy Horadam
    Applied Network Science, 4
  • [32] Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
    Damaschke, Peter
    INFORMATION PROCESSING LETTERS, 2014, 114 (06) : 317 - 321
  • [33] Finding maximal bicliques in bipartite networks using node similarity
    Alzahrani, Taher
    Horadam, Kathy
    APPLIED NETWORK SCIENCE, 2019, 4 (01) : 1 - 25
  • [34] Finding the Maximum k-Balanced Biclique on Weighted Bipartite Graphs
    Zhao, Yiwei
    Chen, Zi
    Chen, Chen
    Wang, Xiaoyang
    Lin, Xuemin
    Zhang, Wenjie
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (08) : 7994 - 8007
  • [35] Hamiltonicity in convex bipartite graphs
    P. Kowsika
    V. Divya
    N. Sadagopan
    International Journal of Advances in Engineering Sciences and Applied Mathematics, 2019, 11 : 40 - 52
  • [36] Hamiltonicity in convex bipartite graphs
    Kowsika, P.
    Divya, V.
    Sadagopan, N.
    INTERNATIONAL JOURNAL OF ADVANCES IN ENGINEERING SCIENCES AND APPLIED MATHEMATICS, 2019, 11 (01) : 40 - 52
  • [37] Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
    Acuna, V.
    Ferreira, C. E.
    Freire, A. S.
    Moreno, E.
    DISCRETE APPLIED MATHEMATICS, 2014, 164 : 2 - 12
  • [38] Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
    Stefanes, Marco A.
    Rubert, Diego P.
    Soares, Jose
    THEORETICAL COMPUTER SCIENCE, 2020, 804 : 58 - 71
  • [39] Bandwidth of convex bipartite graphs and related graphs
    Shrestha, Anish Man Singh
    Tayu, Satoshi
    Ueno, Shuichi
    INFORMATION PROCESSING LETTERS, 2012, 112 (11) : 411 - 417
  • [40] Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
    Takazawa, Kenjiro
    DISCRETE OPTIMIZATION, 2017, 26 : 26 - 40
12345