An effective structured approach to finding optimal partitions of networks
- 1 September 1982
- journal article
- Published by Springer Nature in Computing
- Vol. 29 (3), 241-262
- https://doi.org/10.1007/bf02241700
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Theoretical comparisons of search strategies in branch-and-bound algorithmsInternational Journal of Parallel Programming, 1976
- Set Partitioning: A surveySIAM Review, 1976
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Computationally Related ProblemsSIAM Journal on Computing, 1974
- Fast algorithms for bin packingJournal of Computer and System Sciences, 1974
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- Optimal Sequential Partitions of GraphsJournal of the ACM, 1971
- An Approach to Solving Linear Discrete Optimization ProblemsJournal of the ACM, 1970
- Backtrack ProgrammingJournal of the ACM, 1965
- Discrete OptimizingJournal of the Society for Industrial and Applied Mathematics, 1965