The optimal partitioning of networks

DOI10.1002/net.3230220307zbMath0780.90032OpenAlexW1996470228MaRDI QIDQ3993635

Chung-Kuan Cheng

Publication date: 23 July 1992

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

partitionsroutingVLSI circuit design

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Linear programming (90C05) Deterministic network models in operations research (90B10)

Cites Work

• A new polynomial-time algorithm for linear programming
• Multi-terminal maximum flows in node-capacitated networks
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Maximal Flow Through a Network
• Multiple-way network partitioning
• An Efficient Heuristic Procedure for Partitioning Graphs
• Large-Scale Network Topological Optimization
• Lower Bounds for the Partitioning of Graphs

This page was built for publication: The optimal partitioning of networks