A parallel maximum clique algorithm for large and massive sparse graphs

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_parallel_maximum_clique_algorithm_for_large_and_massive_sparse_graphs&oldid=62499816"