Modeling hypergraphs by graphs with the same mincut properties
type: Item
instance of: scholarly article
title: Modeling hypergraphs by graphs with the same mincut properties
zbMATH Open document ID: 0768.68147
DOI: 10.1016/0020-0190(93)90115-P
author: S. Singh
published in: Information Processing Letters
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 168859
zbMATH Keywords: VLSI layout
zbMATH Keywords: graph partitioning algorithms
zbMATH Keywords: hypergraphs
zbMATH Keywords: cut properties
zbMATH Keywords: edge-weighted graph
zbMATH Keywords: cut-model
zbMATH Keywords: edge-weighted hypergraph
MaRDI profile type: Publication
cites work: An Algorithm for Partitioning the Nodes of a Graph
cites work: A framework for solving VLSI graph layout problems
cites work: Q3972951
cites work: Q3997942
cites work: A Gomory-Hu cut tree representation of a netlist partitioning problem
description: scientific article; zbMATH DE number 168859