scientific article; zbMATH DE number 177540

zbMATH Open0765.68050MaRDI QIDQ4037409FDOQ4037409

Authors: Naoki Katoh, Kazuo Iwano 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• Efficient algorithms for minimum range cut problems
• scientific article; zbMATH DE number 1256719
• scientific article; zbMATH DE number 742961
• Finding k Cuts within Twice the Optimal
• A new approach to the minimum cut problem

zbMATH Keywords

minimum range cut

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (7)

• Efficient algorithms for minimum range cut problems
• I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
• Implementing an efficient minimum capacity cut algorithm
• Cut tree algorithms: An experimental study
• Efficient Algorithms for the Label Cut Problems
• Title not available (Why is that?)
• A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms

This page was built for publication:

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