Algorithm for Mining Maximal Balanced Bicliques Using Formal Concept Analysis
One of the most fundamental models for cohesive subgraph mining in network analysis is that which involves the use of cliques. In bipartite graph analysis, the detection of maximal balanced bicliques (MBB) is an important problem with numerous applications, including VLSI design, protein interaction...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10574232/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|