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 条
  • [31] Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
    Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Z. Szafrana 4a, 65-516 Zielona Góra, Poland
    Inf. Process. Lett., 6 (287-290):
  • [32] The transformation of edge-regular and pseudo strongly regular graphs under graph operations
    Palathingal, Jeepamol J.
    Lakshmanan, Aparna S.
    Markowsky, Greg
    arXiv, 2021,
  • [33] Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
    College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Zhejiang Jinhua, 321004, China
    Discrete Appl Math, 1600, 13 (2778-2784):
1234