Hypergraph k-cut in randomized polynomial time
Crossref DOI link: https://doi.org/10.1007/s10107-019-01443-7
Published Online: 2019-11-13
Published Print: 2021-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chandrasekaran, Karthekeyan
Xu, Chao
Yu, Xilin http://orcid.org/0000-0002-6323-3755
Funding for this research was provided by:
National Science Foundation (CCF-1526799, CCF-1319376)
National Science Foundation (CCF-1907937)
Text and Data Mining valid from 2019-11-13
Version of Record valid from 2019-11-13
Article History
Received: 18 February 2018
Accepted: 28 October 2019
First Online: 13 November 2019