In-place algorithms for computing a largest clique in geometric intersection 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=In-place_algorithms_for_computing_a_largest_clique_in_geometric_intersection_graphs&oldid=64030734"