A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
type: Item
instance of: scholarly article
title: A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
zbMATH Open document ID: 0854.68071
DOI: 10.1016/0166-218X(95)00034-O
author: Yang Dai
author: Hideki Imai
author: Kazuo Iwano
author: Keiji Ohtsuka
author: Nobuhiko Yoshimura
author: Naoki Katoh
published in: Discrete Applied Mathematics
publication date: 1996-07-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 897379
zbMATH Keywords: multigraph
zbMATH Keywords: minimum range cut problems
describes a project that uses: DIMACS
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: Q3056948
cites work: New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
cites work: Efficient parallel algorithms for some graph problems
cites work: Parallel Merge Sort
cites work: Q4035360
cites work: The Complexity of Multiterminal Cuts
cites work: The solution of some random NP-hard problems in polynomial expected time
cites work: Network Flow and Testing Graph Connectivity
cites work: Q4198056
cites work: A new approach to the maximum-flow problem
cites work: The maximum flow problem is log space complete for P
cites work: Q4763403
cites work: Q4023519
cites work: Q3140397
cites work: An Õ(n2) algorithm for minimum cuts
cites work: Q4037409
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Q4763402
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q3997942
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: Selected Applications of Minimum Cuts in Networks
cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems
cites work: An O(logn) parallel connectivity algorithm
cites work: A data structure for dynamic trees
cites work: Multiprocessor Scheduling with the Aid of Network Flow Algorithms
full work available at URL: 0166-218x(95)00034-o
OpenAlex ID: W1967536438
description: scientific article; zbMATH DE number 897379