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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical methods in the applied sciences Jg. 48; H. 15; S. 14110 - 14120
Hauptverfasser:	Ma, Ronghua, Yao, Weibin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Freiburg Wiley Subscription Services, Inc 01.10.2025
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!