For example,Бобцов

USING OF ADJACENT NEIGHBORHOOD AT GREEDY SEQUENTIAL PARTITION OF PARALLEL GRAPH-SCHEMES

Annotation

  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

Articles in current issue