Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n (Q2894465)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n |
scientific article |
Statements
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n (English)
0 references
29 June 2012
0 references
