An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730)
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 5664491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs |
scientific article; zbMATH DE number 5664491 |
Statements
An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (English)
0 references
29 January 2010
0 references
approximation algorithms
0 references
path factor
0 references
subcubic graph
0 references
0.8790314793586731
0 references
0.8664186000823975
0 references
0.8513107299804688
0 references
0.8422999978065491
0 references
0.793914258480072
0 references
