Funder
Prime Minister’s Research Fellowship, MOE, Govt. of India
NSF
Science and Engineering Research Board, Department of Science and Technology
Publisher
Springer Science and Business Media LLC
Reference33 articles.
1. (2024) OFF format. http://www.geomview.org/docs/html/OFF.html. Accessed 14 May 2024
2. Amaldi, E., Iuliano, C., Jurkiewicz, T., et al.: Breaking the $${O}(m^2n)$$ barrier for minimum cycle bases. In: Fiat, A., Sanders, P. (eds.) Algorithms—ESA 2009, pp. 301–312. Springer, Berlin (2009)
3. Bauer, U., Kerber, M., Reininghaus, J., et al.: PHAT—persistent homology algorithms toolbox. J. Symb. Comput. 78, 76–90 (2017). https://doi.org/10.1016/j.jsc.2016.03.008
4. Bauer, U., Kerber, M., Reininghaus, J.: Persistent homology algorithm toolbox. https://github.com/blazs/phat. Accessed 14 May 2024 (2024)
5. Boost (2023) Boost library. https://boost.org. Accessed 18 April 2023