Blar i Department of Informatics på emneord "Exponential Time Hypothesis"
Viser treff 1-1 av 1
-
Solving the 2-disjoint connected subgraphs problem faster than 2ⁿ
(Peer reviewed; Journal article, 2014-10)The 2-DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ...