Solving the 2-disjoint connected subgraphs problem faster than \(2^{n }\) (Q2894465)
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 6051297
| 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 6051297 |
Statements
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n (English)
0 references
29 June 2012
0 references
0.9957135915756226
0 references
0.8491061329841614
0 references
0.8264363408088684
0 references
0.8200375437736511
0 references
0.8074532747268677
0 references
