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 this page instead for the normal view: An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O^*(1.4366^n)\)-time exact algorithm for maximum \(P_2\)-packing in cubic graphs |
scientific article |
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
