A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs

From MaRDI portal

(Redirected from A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs)

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_Faster_Algorithm_for_Finding_Maximum_Independent_Sets_in_Sparse_Graphs&oldid=80644508"