Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n
Work
Year: 2013
Type: article
Abstract: The 2-Disjoint Connected Subgraphs problem, given a graph along with two disjoint sets of terminals Z 1,Z 2, asks whether it is possible to find disjoint sets A 1,A 2, such that Z 1⊆A 1, Z 2⊆A 2 and A... more
Source: Algorithmica
Institutions University of Warsaw, University of Bergen
Cites: 26
Cited by: 41
Related to: 10
FWCI: 0.571
Citation percentile (by year/subfield): 83.27
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,890