Cite

HARVARD Citation

    Nie, J. et al. (2021). Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth. Random structures & algorithms. 59 (1), pp. 79-95. [Online]. 
  
Back to record