Efficient algorithm for graph-partitioning problem using a problem transformation method
type: Item
instance of: scholarly article
title: Efficient algorithm for graph-partitioning problem using a problem transformation method
zbMATH Open document ID: 0692.05053
DOI: 10.1016/0010-4485(89)90159-0
author: Jianyong Qiao
author: Sumit K. Garg
published in: CAD. Computer-Aided Design
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4132209
zbMATH Keywords: electronic design automation
zbMATH Keywords: circuit partitioning
zbMATH Keywords: k-way graph- partitioning problem
zbMATH Keywords: Kernighan-Lin algorithm
zbMATH Keywords: maximum cutset
zbMATH Keywords: uniform k- way partitioning problem
zbMATH Keywords: max-cut problem
MaRDI profile type: Publication
full work available at URL: 0010-4485(89)90159-0
OpenAlex ID: W1964201692
description: scientific article; zbMATH DE number 4132209