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

From MaRDI portal
(Redirected from Solving the 2-disjoint connected subgraphs problem faster than 2ⁿ)
Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)

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