Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6387687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) |
scientific article; zbMATH DE number 6387687 |
Statements
Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (English)
0 references
19 January 2015
0 references
exact algorithms
0 references
\(2^n\) barrier
0 references
2-disjoint connected subgraphs
0 references
kernelization
0 references
exponential time hypothesis
0 references
0.9957135915756226
0 references
0.8471503853797913
0 references
0.8216009140014648
0 references
0.8169453740119934
0 references
0.8014963865280151
0 references
