Efficient algorithms for minimum range cut problems

DOI10.1002/NET.3230240705MaRDI QIDQ4313630zbMATH OpenOpenAlexFDO

Authors Naoki Katoh, Kazuo Iwano

Publication date 27 November 1994

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230240705

zbMATH Keywords

minimum spanning treeundirected graphsancestor treeminimum range cut problemupper-critical cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 177540
• scientific article; zbMATH DE number 742961
• Fundamentals of Computation Theory
• Minimum cuts in near-linear time
• A simple and fast min-cut algorithm

Cites work

• scientific article; zbMATH DE number 437525 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 49142 (Why is no real title available?)
• scientific article; zbMATH DE number 742960 (Why is no real title available?)
• scientific article; zbMATH DE number 742961 (Why is no real title available?)
• An Õ(n²) algorithm for minimum cuts

Cited in

(12)

• A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems
• scientific article; zbMATH DE number 177540 (Why is no real title available?)
• Minimum dispersion problems
• The quadratic balanced optimization problem
• The balanced traveling salesman problem
• Balanced Optimization with Vector Costs
• Robust balanced optimization
• Efficient Algorithms for the Label Cut Problems
• Exact algorithms for the equitable traveling salesman problem
• A branch-and-cut algorithm for the balanced traveling salesman problem
• Massively Parallel Algorithms for Minimum Cut
• Implementing an efficient minimum capacity cut algorithm

This page was built for publication: Efficient algorithms for minimum range cut problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4313630)