Maximum Balanced (k, e)-Bitruss Detection in Signed Bipartite Graph
Summary: Introduce balanced (k,e)-bitruss: cohesive signed bipartite subgraph defined by balanced butterflies (4-cycles with an even number of negative edges), parametrized by density k and balance e. Prove max problem NP-hard and inapproximable; extend butterfly counting and propose two greedy heuristics, with a balanced-support-ratio greedy performing best. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kai Hiu CHUNG
- 2. Alexander ZHOU
- 3. Yue WANG
- 4. Lei CHEN
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 844 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00013704523 |
| 1,352 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.0001116702 |
| 3,634 | Accelerating Truss Decomposition on Heterogeneous Processors | 2020 | VLDB | 7.3118793e-05 |
| 3,670 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB | 7.2766367e-05 |
Previous
Page 1 / 1
Next