An improved branch and bound algorithm for the maximum clique problem
From MaRDI portal
(Redirected from An improved branch and bound algorithm for the maximum clique problem)
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
