Finding maximal bicliques in bipartite networks using node similarity

被引：0
|
作者：
Taher Alzahrani
Kathy Horadam
机构：
[1] Mathematical Sciences,
[2] RMIT University,undefined
来源：
Applied Network Science | / 4卷
关键词：
Bipartite network; Overlapping community detection; Maximal biclique; Community strength; Node similarity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In real world complex networks, communities are usually both overlapping and hierarchical. A very important class of complex networks is the bipartite networks. Maximal bicliques are the strongest possible structural communities within them.
引用
收藏
相关论文
共 50 条
  • [1] Finding maximal bicliques in bipartite networks using node similarity
    Alzahrani, Taher
    Horadam, Kathy
    APPLIED NETWORK SCIENCE, 2019, 4 (01) : 1 - 25
  • [2] Finding maximum edge bicliques in convex bipartite graphs
    Nussbaum, Doron
    Pu, Shuye
    Sack, Jörg-Rüdiger
    Uno, Takeaki
    Zarrabi-Zadeh, Hamid
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, 6196 LNCS : 140 - 149
  • [3] 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
  • [4] Efficient maintenance for maximal bicliques in bipartite graph streams
    Ma, Ziyi
    Liu, Yuling
    Hu, Yikun
    Yang, Jianye
    Liu, Chubo
    Dai, Huadong
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2022, 25 (02): : 857 - 877
  • [5] Efficient maintenance for maximal bicliques in bipartite graph streams
    Ziyi Ma
    Yuling Liu
    Yikun Hu
    Jianye Yang
    Chubo Liu
    Huadong Dai
    World Wide Web, 2022, 25 : 857 - 877
  • [6] Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph
    Das, Apurba
    Tirthapura, Srikanta
    IEEE TRANSACTIONS ON MULTI-SCALE COMPUTING SYSTEMS, 2018, 4 (03): : 231 - 242
  • [7] 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 - +
  • [8] 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
  • [9] Enumerating maximal bicliques in bipartite graphs with favorable degree sequences
    Damaschke, Peter
    INFORMATION PROCESSING LETTERS, 2014, 114 (06) : 317 - 321
  • [10] A convexity upper bound for the number of maximal bicliques of a bipartite graph
    Albano, Alexandre
    do Lago, Alair Pereira
    DISCRETE APPLIED MATHEMATICS, 2014, 165 : 12 - 24
12345