High-speed minimum cut approximation in dense graph using compacted pruned tree (Q6928210)
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 8095367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High-speed minimum cut approximation in dense graph using compacted pruned tree |
scientific article; zbMATH DE number 8095367 |
Statements
High-speed minimum cut approximation in dense graph using compacted pruned tree (English)
0 references
17 September 2025
0 references
algorithm acceleration
0 references
approximate algorithm
0 references
depth-first traversal
0 references
minimum cut
0 references
tree compacting
0 references
