Construction of hamiltonian paths in graphs of permutation polyhedra.
Електронний архів Полтавського університету економіки і торгівлі
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Construction of hamiltonian paths in graphs of permutation polyhedra.
|
|
| Creator |
Donec G. A.
Koliechkina L. |
|
| Subject |
polyhedral combinatorics
combinatorial set combinatorial permutation set permutation polyhedron graph hyperface Hamiltonian path |
|
| Description |
The problem of finding an extremum of a linear function over a permutation set is considered. The polyhedron of admissible values of this function over permutations is constructed. The constructed graph is shown to be partially ordered with respect to the transposition of two elements of a permutation. Based on this property, a method is proposed for the construction of a Hamiltonian path in the graph corresponding to the permutation set for n 4. |
|
| Publisher |
Cybernetics and Systems Analysis
|
|
| Date |
2016-04-04T08:23:29Z
2016-04-04T08:23:29Z 2010 |
|
| Identifier |
G. A. Donec and L. M. Kolechkina, “Construction of Hamiltonian paths in graphs of permutation polyhedra,” Cybernet. Systems Anal., vol. 46, no. 1, pp. 7–13, 2010.
1060-0396 http://dspace.puet.edu.ua/handle/123456789/3423 |
|
| Language |
en
|
|