Hardness and tractability of the \(\gamma\)-complete subgraph problem

From MaRDI portal

(Redirected from Publication:2032141)
Hardness and tractability of the \(\gamma\)-complete subgraph problem

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=Hardness_and_tractability_of_the_%5C(%5Cgamma%5C)-complete_subgraph_problem&oldid=72463617"