Packing cycles in undirected graphs (Q4458879)
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: Packing cycles in undirected graphs |
scientific article; zbMATH DE number 2055954
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing cycles in undirected graphs |
scientific article; zbMATH DE number 2055954 |
Statements
Packing cycles in undirected graphs (English)
0 references
14 March 2004
0 references
Packing
0 references
Edge-disjoint cycles
0 references
Complexity
0 references
Approximation
0 references
Linear programming relaxation
0 references
0.8997977375984192
0 references
0.8996213674545288
0 references
0.8960599303245544
0 references
0.892340898513794
0 references
