Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)

From MaRDI portal

(Redirected from Publication:486988)
Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)

Jump to:navigation, search

WRNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Solving_the_2-disjoint_connected_subgraphs_problem_faster_than_%5C(2%5En%5C)&oldid=62261250"