High‐Speed Minimum Cut Approximation in Dense Graph Using Compacted Pruned Tree

ABSTRACT Solutions for minimum cut of a graph have been widely used in many applications, but existing acceleration methods have almost reached their limits by optimizing algorithm logic or reducing graph data. Given the mapping between traversal trees and cuts in a graph, we propose to deal with th...

Celý popis

Podrobná bibliografia

Vydané v:	Mathematical methods in the applied sciences Ročník 48; číslo 15; s. 14110 - 14120
Hlavní autori:	Ma, Ronghua, Yao, Weibin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Freiburg Wiley Subscription Services, Inc 01.10.2025
Predmet:	Acceleration algorithm acceleration Algorithms Apexes approximate algorithm Approximation Compacts depth‐first traversal Enumeration Graph theory minimum cut Nodes Optimization tree compacting
ISSN:	0170-4214, 1099-1476
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!