An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P 2\)-packing in cubic graphs

From MaRDI portal

(Redirected from Publication:306106)

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=An_%5C(O%5E*(1.4366%5En)%5C)-time_exact_algorithm_for_maximum_%5C(P_2%5C)-packing_in_cubic_graphs&oldid=60910449"