Journal
Scientific and technical journal «Priborostroenie»
UDK621.397.01
Issue:6 (56)
Download PDF463 Kbyte
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.