Maximum Balanced (k, epsilon)-Bitruss Detection in Signed Bipartite Graph
Summary: Introduces balanced (k, ε)-bitrusses for cohesive signed bipartite subgraphs, regulating butterfly density and sign balance via even-negative 4-cycles. Establishes hardness/inapproximability, extends butterfly counting, and proposes greedy methods, with balanced-support prioritization superior empirically. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Kai Hiu Chung (Hong Kong University of Science and Technology)
- 2. Alexander Zhou (Hong Kong University of Science and Technology)
- 3. Yue Wang (Shenzhen University)
- 4. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@article{chung_vldb24,
title = {{Maximum Balanced (k, epsilon)-Bitruss Detection in Signed Bipartite Graph}},
author = {Chung, Kai Hiu and Zhou, Alexander and Wang, Yue and Chen, Lei},
journal = {PVLDB},
series = {{VLDB} '24},
volume = {17},
number = {3},
pages = {332--344},
doi = {10.14778/3632093.3632099},
url = {https://doi.org/10.14778/3632093.3632099},
year = {2024}
}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 |
|---|---|---|---|---|
| 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB | 0.00014091815 |
| 1,211 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB | 0.00011648789 |
| 3,503 | Accelerating Truss Decomposition on Heterogeneous Processors | 2020 | VLDB | 7.3592701e-05 |
| 3,723 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB | 7.1725638e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 2 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 3 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |
| 4 | 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 5 | 7,144 | Towards Distributed Bitruss Decomposition on Bipartite Graphs | 2022 | VLDB |
| 6 | 9,916 | Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index | 2025 | VLDB |
| 7 | 3,723 | Butterfly Counting on Uncertain Bipartite Graphs | 2022 | VLDB |
| 8 | 3,911 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB |
| 9 | 1,211 | Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks | 2019 | VLDB |
| 10 | 7,455 | Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks | 2023 | SIGMOD |