The Optimal Partitioning of Graphs
- 1 January 1976
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Mathematics
- Vol. 30 (1), 55-69
- https://doi.org/10.1137/0130006
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Recent developments in the automated design and analysis of digital systemsProceedings of the IEEE, 1972
- Optimal Sequential Partitions of GraphsJournal of the ACM, 1971
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- The Theory and Computation of Knapsack FunctionsOperations Research, 1966
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- Improved procedure for interconnecting piece-wise solutionsJournal of the Franklin Institute, 1956