Bidirectional pruned tree-based efficient minimum cut acceleration in dense graph

Wei Wei, Haoyi Li and Qinghui Zhang

Chaos, Solitons & Fractals, 2023, vol. 175, issue P2

Abstract: The minimum cut (min-cut) problem has been extensively investigated, and the corresponding algorithms have been used in many related problems. The recently proposed acceleration strategy based on tree-cut mapping has been shown to be an effective alternative, with a slight loss in acceleration accuracy. However, the existing method requires a large number of ineffective traversal passes in the high-overhead preprocessing step, which has the potential to be significantly improved in mapping effective graphs, i.e. dense graphs. To solve the problem, we propose to use bidirectional pruned tree for tree-cut mapping, which combines pruned depth-first traversal tree and bidirectional traversal paths to enumerate as many different tree instances as possible. Thus, it can help find the min-cut of any node pair efficiently. Theoretical analysis also shows its potential. For its serial implementation in a graph with M edges, after a preprocessing step with a time complexity as low as O(M), 99.9% of sampled node pairs can obtain their exact min-cut value in various types of dense graphs with degrees greater than 8 in experiments. In addition, the same precision can be obtained in sparse graphs in case of unit capacity. Per-pair running time in a million-node graph can be several orders of magnitude faster than existing methods and as low as several microseconds, so can be used as an effective complement to existing methods.

Keywords: Graph theory; Minimum cut; Bidirectional path; Dense graph; Tree pruning (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0960077923009244
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:175:y:2023:i:p2:s0960077923009244

DOI: 10.1016/j.chaos.2023.114023

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().