Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n

Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n. In David Fernández-Baca, editor, LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings. Volume 7256 of Lecture Notes in Computer Science, pages 195-206, Springer, 2012. [doi]

Abstract

Abstract is missing.