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

DOI10.1007/978-3-642-29344-3_17MaRDI QIDQ2894465zbMATH OpenOpenAlexFDO

Authors Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, 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

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

Recommendations

• Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)
• Connecting Terminals and 2-Disjoint Connected Subgraphs
• On partitioning a graph into two connected subgraphs
• On partitioning a graph into two connected subgraphs
• Partitioning graphs into connected parts

Cited in

(6)

• Partitioning graphs into connected parts
• Using patterns to form homogeneous teams
• Largest Chordal and Interval Subgraphs Faster Than 2 n
• Partitioning Graphs into Connected Parts
• On partitioning a graph into two connected subgraphs
• Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)

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)