Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs

Chen, L, Liu, C, Zhou, R, Xu, J and Li, Jianxin 2021, Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs, in SIGMOD/PODS 2021 : Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM, New York, N.Y., pp. 248-260, doi: 10.1145/3448016.3459241.

Attached Files
Name Description MIMEType Size Downloads

Title Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs
Author(s) Chen, L
Liu, C
Zhou, R
Xu, J
Li, JianxinORCID iD for Li, Jianxin orcid.org/0000-0002-9059-330X
Conference name Management of Data. Conference (2021 : Online, China)
Conference location Online, China
Conference dates 20-25 Jun. 2021
Title of proceedings SIGMOD/PODS 2021 : Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
Publication date 2021
Start page 248
End page 260
Total pages 13
Publisher ACM
Place of publication New York, N.Y.
Keyword(s) bipartite graph
biclique
CORE2020 A*
ISBN 9781450383431
Language eng
DOI 10.1145/3448016.3459241
Indigenous content off
HERDC Research category E1 Full written paper - refereed
Persistent URL http://hdl.handle.net/10536/DRO/DU:30153483

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 1 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 18 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Mon, 12 Jul 2021, 13:42:32 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.