Correction to: Scientific Reports https://doi.org/10.1038/s41598-018-23932-z, published online 13 April 2018
In Algorithm 1, line 12, the superscripted number 48 should not be present. The correct Algorithm 1 appears below.
graph partitioning via clique conductance minimization
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Lu, Z., Wahlström, J. & Nehorai, A. Publisher Correction: Community Detection in Complex Networks via Clique Conductance. Sci Rep 8, 11176 (2018). https://doi.org/10.1038/s41598-018-29006-4
Published:
DOI: https://doi.org/10.1038/s41598-018-29006-4
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.
