Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n
From MaRDI portal
Publication:2894465
DOI10.1007/978-3-642-29344-3_17zbMath1353.68117OpenAlexW2208287652MaRDI QIDQ2894465
Marcin Pilipczuk, Michał Pilipczuk, Marek Cygan, Jakub Onufry Wojtaszczyk
Publication date: 29 June 2012
Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_17
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items