Packing cycles exactly in polynomial time (Q421271)
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 6038107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing cycles exactly in polynomial time |
scientific article; zbMATH DE number 6038107 |
Statements
Packing cycles exactly in polynomial time (English)
0 references
23 May 2012
0 references
packing and covering
0 references
polynomial algorithm
0 references
min-max relation
0 references
maximum cycle packing
0 references
0.8116697072982788
0 references
0.8037495613098145
0 references
0.7949306964874268
0 references
