Orecchia, Lorenzo, Ameranis, Konstantinos, Tsourakakis, Charalampos, and Talwar, Kunal. Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. Retrieved from https://par.nsf.gov/biblio/10349734. Proceedings of the 39th International Conference on Machine Learning (ICML 2022) in Proceedings of Machine Learning Research 162.

Orecchia, Lorenzo, Ameranis, Konstantinos, Tsourakakis, Charalampos, & Talwar, Kunal. Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering. Proceedings of the 39th International Conference on Machine Learning (ICML 2022) in Proceedings of Machine Learning Research, 162 (). Retrieved from https://par.nsf.gov/biblio/10349734.

Orecchia, Lorenzo, Ameranis, Konstantinos, Tsourakakis, Charalampos, and Talwar, Kunal. "Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering". Proceedings of the 39th International Conference on Machine Learning (ICML 2022) in Proceedings of Machine Learning Research 162 (). Country unknown/Code not available. https://par.nsf.gov/biblio/10349734.

@article{osti_10349734,
place = {Country unknown/Code not available}, title = {Practical Almost-Linear-Time Approximation Algorithms for Hybrid and Overlapping Graph Clustering}, url = {https://par.nsf.gov/biblio/10349734}, abstractNote = {}, journal = {Proceedings of the 39th International Conference on Machine Learning (ICML 2022) in Proceedings of Machine Learning Research}, volume = {162}, author = {Orecchia, Lorenzo and Ameranis, Konstantinos and Tsourakakis, Charalampos and Talwar, Kunal}, }