Algorithms for solving the partitioning problem
P. Korošec, B. Robič, J. Šilc
Deseta mednarodna Elektrotehniška in računalniška konferenca ERK 2001
Portorož, Slovenija, 24-26 September, 2001
In this article we represent comparison and evaluation of different algorithms for solving partitioning problem. The main purpose is to show, how the algorithms behave when used on different types of graphs and to evaluate, which of them is the best algorithm. Partitioning problem is mainly used in co-planning hardware and software equipment. With the use of partitioning, we are especially trying to reduce the costs of building systems and to fasten system operations.
BIBTEX copied to Clipboard