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

DOI10.1007/978-3-642-29344-3_17zbMATH Open1353.68117OpenAlexW2208287652MaRDI QIDQ2894465FDOQ2894465

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Connectivity (05C40)

Cited In (2)

• Largest Chordal and Interval Subgraphs Faster Than 2 n
• Using patterns to form homogeneous teams

This page was built for publication: Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894465)