Article ID: | iaor19981818 |
Country: | China |
Volume: | 12 |
Issue: | 4 |
Start Page Number: | 393 |
End Page Number: | 400 |
Publication Date: | Oct 1996 |
Journal: | Acta Mathematicae Applicanda Sinica |
Authors: | Simeone B., Liu Y., Morgana A. |
This paper shows a graph partition problem to be polynomially solvable. Moreover, the problem in the plane case leads to a number of problems in graphs and combinatorial optimizations which are also polynomially solvable.