4.7 Article

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

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Engineering, Biomedical

An unsupervised method for histological image segmentation based on tissue cluster level graph cut

Hongming Xu et al.

Summary: This study introduces a new unsupervised method, TisCut, for assisting tissue image segmentation and annotations, showing comparative performance with U-Net models in necrosis and melanoma detections.

COMPUTERIZED MEDICAL IMAGING AND GRAPHICS (2021)

Article Telecommunications

Minimum Cut Acceleration by Exploiting Tree-Cut Injection for Upper Bound Estimation

Wei Wei et al.

Summary: The researchers proposed the TCMA algorithm, which uses injections from traversal trees to cuts in an undirected graph to calculate the upper bound of min-cut value between any node pair, leading to a high probability match with the accurate min-cut value. Unlike other methods, TCMA is general enough to not rely on any special topology and can achieve high acceleration ratio and precision in various graphs.

IEEE COMMUNICATIONS LETTERS (2021)

Article Computer Science, Hardware & Architecture

Optimal Submarine Cable Path Planning and Trunk-and-Branch Tree Network Topology Design

Zengfu Wang et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2020)

Article Computer Science, Artificial Intelligence

Liver CT sequence segmentation based with improved U-Net and graph cut

Zhe Liu et al.

EXPERT SYSTEMS WITH APPLICATIONS (2019)

Article Engineering, Electrical & Electronic

STAG-Based QoS Support Routing Strategy for Multiple Missions Over the Satellite Networks

Tao Zhang et al.

IEEE TRANSACTIONS ON COMMUNICATIONS (2019)

Article Agricultural Engineering

Rice yield estimation based on K-means clustering with graph-cut segmentation using low-altitude UAV images

Md Nasim Reza et al.

BIOSYSTEMS ENGINEERING (2019)

Article Computer Science, Interdisciplinary Applications

Speed scaling on parallel processors with migration

Eric Angel et al.

JOURNAL OF COMBINATORIAL OPTIMIZATION (2019)

Article Computer Science, Information Systems

Minimization of the network availability upgrade cost with geodiverse routing for disaster resilience

Amaro de Sousa et al.

OPTICAL SWITCHING AND NETWORKING (2019)

Article Telecommunications

SPLMax: Exploiting the Simple Path Introduced Locality for Maximum Flow Acceleration

Wei Wei et al.

IEEE COMMUNICATIONS LETTERS (2018)

Article Engineering, Electrical & Electronic

Power System Structural Vulnerability Assessment Based on an Improved Maximum Flow Approach

Jiakun Fang et al.

IEEE TRANSACTIONS ON SMART GRID (2018)

Article Computer Science, Hardware & Architecture

Enhancing Network Robustness via Shielding

Jianan Zhang et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2017)

Review Computer Science, Hardware & Architecture

Efficient Maximum Flow Algorithms

Andrew V. Goldberg et al.

COMMUNICATIONS OF THE ACM (2014)

Article Mathematics, Applied

Simplifying maximum flow computations: The effect of shrinking and good initial flows

F. Liers et al.

DISCRETE APPLIED MATHEMATICS (2011)