|
Degree
|
Student, Faculty of Computational Mathematics and Informatics, South Ural State University
|
|
E-mail
|
alfaigor74@gmail.com
|
|
Location
|
Cheliabinsk
|
|
Articles
|
Problem of allowed path construction for a graph is considered. It is shown that in the Euler graph is possible to build a valid Euler tour and in arbitrary chosen graph it’s possible to build a valid network. The algorithms presented are complimented by examples using software developed by the authors.
Read more...
|
