Author:
Severt Marcos,Casado-Vara Roberto,del Rey Angel Martín,Jove Esteban,Quintián Héctor,Calvo-Rolle Jose Luis
Publisher
Springer Nature Switzerland
Reference22 articles.
1. Abboud, A., Krauthgamer, R., Trabelsi, O.: Subcubic algorithms for Gomory-Hu tree in unweighted graphs. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1725–1737 (2021)
2. Hariharan, R., Kavitha, T., Panigrahi, D., Bhalgat, A.: An O(mn) Gomory-Hu tree construction algorithm for unweighted graphs. In: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, pp. 605–614 (2007)
3. Gupta, A., Lee, E., Li, J.: Faster exact and approximate algorithms for k-Cut. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 113–123. IEEE (2018)
4. Bhaskar, R., Bansal, A.: Implementing prioritized-breadth-first-search for instagram hashtag recommendation. In: 2022 12th International Conference on Cloud Computing, Data Science and Engineering (Confluence), pp. 66–70. IEEE (2022)
5. Shinde, N., Narayanan, V., Saunderson, J.: Memory-efficient approximation algorithms for max-k-Cut and correlation clustering. Adv. Neural. Inf. Process. Syst. 34, 8269–8281 (2021)