An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments

From MaRDI portal

(Redirected from Publication:868636)

Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_efficient_branch-and-bound_algorithm_for_finding_a_maximum_clique_with_computational_experiments&oldid=64994379"