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)): ?>

Method of forming routing domains with optimal number of edge router

Kogan A. V.

Method of forming routing domains with optimal number of edge routers. Proposed and justified method of forming a minimum cross-section area of the graph, which is carried out by the operations on the set of vertices of G and its subgraphs. On cross-domain level boundary routers combined with each other in a virtual network with disjoint links within each subnet. Keywords: multi-path routing, minimum cross-section of the graph, edge routers


Full text (pdf)