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
相关论文
共 33 条
  • [11] MATCHING PROBLEM FOR BIPARTITE GRAPHS WITH POLYNOMIALLY BOUNDED PERMANENTS IS IN NC.
    Grigoriev, Dima Yu
    Karpinski, Marek
    Annual Symposium on Foundations of Computer Science (Proceedings), 1987, : 166 - 171
  • [12] Recognizing Helly Edge-Path-Tree graphs and their clique graphs
    Istituto per le Applicazioni Del Calcolo, M. Picone, Via G. Amendola, 122/D, I-70126 Bari, Italy
    不详
    Discrete Appl Math, 11 (1166-1175):
  • [13] Adjacent Vertex Reducible Edge Coloring for graphs
    Ding, Zhe
    Li, Jingwen
    Luo, Rong
    Zhang, Lijing
    IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC), 2022, 2022-June : 1049 - 1053
  • [14] On the adjacent vertex distinguishing edge colourings of graphs
    School of Mathematics and System Sciences, Shandong University, Jinan, China
    Int J Comput Math, 4 (726-732):
  • [15] On the maximum degree of 3t-critical graphs
    Barioli, Francesco
    Merwe, Lucas Van Der
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2012, 80 : 225 - 242
  • [16] Maximum spread of Kr-minor free graphs∗
    Wang, Wenyan
    Liu, Lele
    Wang, Yi
    arXiv,
  • [17] Research on network users archives matching based on maximum weight matching of bipartite graph
    Ding, Yejin
    International Journal of Simulation: Systems, Science and Technology, 2015, 16 (2B): : 1 - 16
  • [18] AN ALGORITHMIC APPROACH TO ANTIMAGIC LABELING OF EDGE CORONA GRAPHS
    Nivedha, D.
    Yamini, S. Devi
    arXiv, 2022,
  • [19] Exploration of k-edge-deficient temporal graphs
    Erlebach, Thomas
    Spooner, Jakob T.
    ACTA INFORMATICA, 2022, 59 (04) : 387 - 407
  • [20] Edge sparsification for graphs via meta-learning
    Wan, Guihong
    Schweitzer, Haim
    Proceedings - International Conference on Data Engineering, 2021, 2021-April : 2733 - 2738
1234