.png){kind=icon}
返回
Minimum Cut Acceleration by Exploiting Tree-Cut Injection for Upper Bound Estimation
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.3028620.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
As a basic problem in graph theory, the minimum cut (min-cut) problem has important applications in communication related researches. There are injections from the set of all traversal trees to the set of all cuts. However, this kind of injection is completely ignored in existing methods, which may lead to the lose of acceleration opportunity. Accordingly, we propose Traversal Tree-Cut Injection based Min-Cut Acceleration algorithm (TCMA). By collecting enough cuts from different traversal trees in an undirected graph, the upper bound of min-cut value between any node pair can be calculated as the minimal value of all related cuts, which can match the accurate min-cut value with high probability. We compare TCMA with other methods using random and real-world graphs. The results show that different from other methods, TCMA is general enough to not rely on any special topology, and can achieve both high acceleration ratio and precision in various graphs, thus can be used as an effective supplement to existing methods.
Keyword:
Acceleration
Upper bound
Topology
Information processing
Training
Directed graphs
Minimum cut
traversal tree
upper bound
graph preprocessing
acceleration
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
分享收藏分享收藏Structural effects of diamines on synthesis, polymerization, and properties of benzoxazines based on o-allylphenol.png)
Polymer
PolymerIF0
PREAI
分享收藏
查看更多内容