A sufficiently fast algorithm for finding close to optimal clique trees

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_sufficiently_fast_algorithm_for_finding_close_to_optimal_clique_trees&oldid=97667279"