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

Full description

Bibliographic Details

Published in:	Mathematical methods in the applied sciences Vol. 48; no. 15; pp. 14110 - 14120
Main Authors:	Ma, Ronghua, Yao, Weibin
Format:	Journal Article
Language:	English
Published:	Freiburg Wiley Subscription Services, Inc 01.10.2025
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!