"Faster Minimum k-cut of a Simple Graph."

Jason Li (2019)

Details and statistics

DOI: 10.1109/FOCS.2019.00068

access: closed

type: Conference or Workshop Paper

metadata version: 2020-11-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics