The complexity of finding uniform sparsest cuts in various graph classes

From MaRDI portal

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.