On packing shortest cycles in graphs (Q989491)
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: On packing shortest cycles in graphs |
scientific article; zbMATH DE number 5773804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On packing shortest cycles in graphs |
scientific article; zbMATH DE number 5773804 |
Statements
On packing shortest cycles in graphs (English)
0 references
20 August 2010
0 references
algorithms
0 references
approximation algorithms
0 references
combinatorial problems
0 references
graph algorithms
0 references
shortest cycles
0 references
packing
0 references
complexity
0 references
0.7855981588363647
0 references
0.784904420375824
0 references
0.781876802444458
0 references
0.7739386558532715
0 references
