Circuit partitioning with size and connection constraints
- 1 September 1983
- Vol. 13 (3) , 365-375
- https://doi.org/10.1002/net.3230130305
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for TreesMathematics of Operations Research, 1983
- A Linear Tree Partitioning AlgorithmSIAM Journal on Computing, 1977
- Efficient Algorithm for the Partitioning of TreesIBM Journal of Research and Development, 1974