An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (Q306106)
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 6620844
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs |
scientific article; zbMATH DE number 6620844 |
Statements
An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs (English)
0 references
31 August 2016
0 references
\(P_2\)-packing
0 references
cubic graphs
0 references
branch-and-reduce algorithms
0 references
measure-and-conquer
0 references
0.8505587577819824
0 references
0.8422999978065491
0 references
0.8367204666137695
0 references
0.8105387091636658
0 references
0.7796918153762817
0 references
