Solving the 2-disjoint connected subgraphs problem faster than 2n

Marek Cygan
Marcin Pilipczuk
Michal Pilipczuk
Proceedings of the 10th Latin American international conference on Theoretical Informatics, Springer-Verlag, Berlin, Heidelberg (2012), pp. 195-206

Abstract