USING OF ADJACENT NEIGHBORHOOD AT GREEDY SEQUENTIAL PARTITION OF PARALLEL GRAPH-SCHEMES
Kursk State Technical University, Department of Computer Technique;
M. E. Leonov
South-West State University, Department of Computer Science and Engineering, Kursk; Post-Graduate Student
Read the full article
Abstract. A method and algorithm for partition of parallel graph-schemes using adjacent neighborhood within greedy sequential approach are proposed. Numerical estimates of obtained partitions are presented.
Keywords:
logical control system, logical multi-controllers design, partition, parallel algorithm graphscheme, discrete combinatorial optimization, heuristic methods
