An O(K.n**4) algorithm for finding the K best cuts in a network
From MaRDI portal
(Redirected from An O(K.n**4) algorithm for finding the K best cuts in a network)
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.