Algorithm to find a maximum 2-packing set in a cactus (Q1748991)
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: Algorithm to find a maximum 2-packing set in a cactus |
scientific article; zbMATH DE number 6868603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm to find a maximum 2-packing set in a cactus |
scientific article; zbMATH DE number 6868603 |
Statements
Algorithm to find a maximum 2-packing set in a cactus (English)
0 references
15 May 2018
0 references
graph algorithms
0 references
maximum 2-packing set
0 references
cactus
0 references
unicycle
0 references
0 references
0 references
0.86177564
0 references
0.8474802
0 references
0.8425091
0 references
0.8392881
0 references
0.83812076
0 references
0.83569235
0 references
