The University of Warwick Library - WebBridge

Solving the 2-Disjoint connected subgraphs problem faster than 2n
Cygan, Marek.  Algorithmica.  v. Volume 70. no. Number 2.   2013-05-14. p. 195 - 207... issn: 0178-4617 .   

Online access not found

Sorry - based on the information provided, WebBridge cannot offer appropriate links.