An optimal pruned traversal tree-based fast minimum cut solver in dense graph

DOI10.1016/j.ins.2023.119768OpenAlexW4387493109MaRDI QIDQ6059625

No author found.

Publication date: 2 November 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2023.119768

zbMATH Keywords

minimum cutaccelerationgraph preprocessingoptimal pruned treetree-cut mapping

Mathematics Subject Classification ID

Biology and other natural sciences (92-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Simplifying maximum flow computations: the effect of shrinking and good initial flows
• Speed scaling on parallel processors with migration
• A simple min-cut algorithm
• Distributed weighted min-cut in nearly-optimal time
• Deterministic mincut in almost-linear time

This page was built for publication: An optimal pruned traversal tree-based fast minimum cut solver in dense graph