A much faster branch-and-bound algorithm for finding a maximum clique

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=A_much_faster_branch-and-bound_algorithm_for_finding_a_maximum_clique&oldid=82292804"