Analysis of a class of graph partitioning problems
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 3, pp. 255-261.
@article{ITA_1982__16_3_255_0,
     author = {Bertolazzi, P. and Lucertini, M. and Marchetti Spaccamela, A.},
     title = {Analysis of a class of graph partitioning problems},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {255--261},
     publisher = {EDP-Sciences},
     volume = {16},
     number = {3},
     year = {1982},
     zbl = {0489.68066},
     mrnumber = {686916},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1982__16_3_255_0/}
}
TY  - JOUR
AU  - Bertolazzi, P.
AU  - Lucertini, M.
AU  - Marchetti Spaccamela, A.
TI  - Analysis of a class of graph partitioning problems
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1982
DA  - 1982///
SP  - 255
EP  - 261
VL  - 16
IS  - 3
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1982__16_3_255_0/
UR  - https://zbmath.org/?q=an%3A0489.68066
UR  - https://www.ams.org/mathscinet-getitem?mr=686916
LA  - en
ID  - ITA_1982__16_3_255_0
ER  - 
Bertolazzi, P.; Lucertini, M.; Marchetti Spaccamela, A. Analysis of a class of graph partitioning problems. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 16 (1982) no. 3, pp. 255-261. http://www.numdam.org/item/ITA_1982__16_3_255_0/

1. N. Christofides and P. Brooker, The Optimal Partitioning of Graphs, S.I.A.M. J. App. Math., January 1976. | MR 405911 | Zbl 0321.05123

2. M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman and Co., 1979. | MR 519066 | Zbl 0411.68039

3. F.O. Hadlock, Minimum Spanning Forest of Bounded Trees, Proc. 5th Southeastern Conf. on Combinatorics, Graph theory and Computing, Winnipeg., 1974. | MR 357180 | Zbl 0322.05104

4. L. Hyafil and K. L. Rivest, Graph Partitioning and Constructing Optimal Decision Trees are Polynomial Complete Problem, Re. 33 I.R.I.A.-Laboria, Rocquencourt, France, 1973.

5. R. M. Karp, Reducibility among Combinatorial Problems, in R. E. MILLER and J. W. THATCHER Eds., Complexity of Computer Computations, Plenum Press, N.Y., 1972. | MR 378476 | Zbl 0366.68041

6. B. W. Kernighan, Some Graph Partitioning Problems Related to Program Segmentation, Ph. D. Thesis, Princeton Univ., N.J., January 1969.

7. E. L. Lawler, Fast Approximation Algorithms for Knapsack Problems, Proc. 18th Ann. Symp. on Foundations of Computer Science, I.E.E.E. Comp. Soc, Long Beach, 1977. | MR 525705 | Zbl 0389.90071

8. E. L. Lawler, K. N. Levitt and J. Turner, Module Clustering to Minimize Delay in Digital Networks, I.E.E.E. Tr. on Comp. C-18, 1969. | Zbl 0172.20603

9. J. A. Lukes, Efficient Algorithm for the Partitioning of Trees, I.B.M. J. Res. Develop., Vol. 18, 1974. | MR 345440 | Zbl 0289.68008

10. G. S. Rao, H. S. Stone and T. C. Hu, Assignment of Tasks in a Distributed Processor System with Limited Memory, I.E.E.E. Tr. on Comp., C-28, 1979. | MR 528357 | Zbl 0397.68024