Linear time algorithms for finding sparsest cuts in various graph classes

P.S. Bonsma

Research output: Contribution to journalArticleAcademic

5 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Linear time algorithms for finding sparsest cuts in various graph classes'. Together they form a unique fingerprint.