An improved branch and bound algorithm for the maximum clique problem

From MaRDI portal

Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_improved_branch_and_bound_algorithm_for_the_maximum_clique_problem&oldid=79457201"