post_parent): $temp_content = $post->post_content; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[1]; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[0]; $temp_content = strip_tags($temp_content); $temp_content = trim($temp_content); $authors = explode(",",$temp_content); ?> post_title));?>"> $value): ?> "> "> "> post_content); while ($parser->parse()) { if (($parser->iNodeName=="a")&&(substr_count($parser->iNodeAttributes['href'],".pdf")>0)): ?>

Algorithm for creating binomial graph toplogy in a fully connected system

Kulakov Y.A., Gorobets A.N.

In this paper we described an algorithm for the constructing binomial graph topology in a fully connected system. Parallel execution of the algorithm parts form a ring topology, and then fill in lists of links to nodes, in accordance with rules that describe binomial graph topology.


Full text (pdf)