Add to ORKGThe 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
The domination and Hamilton circuit problems are of interest both in algorithm design and complexity...
AbstractWe say that a polyhedron with 0–1 valued vertices is combinatorial if the midpoint of the li...
AbstractWe say that a polyhedron with 0–1 valued vertices is combinatorial if the midpoint of the li...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The paper deals with a new method of solving a combinatorial problem with account for the properties...
The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and dis...
The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and dis...
The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and dis...
The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and dis...
AbstractPaths along faces of a polyhedron can be assimilated to paths along the branches of a tree g...
. In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube...
AbstractThere are various greedy schemas to construct a maximal path in a given input graph. Associa...
The content of the thesis is divided into two parts; graph theory and linear programming. The main r...
The domination and Hamilton circuit problems are of interest both in algorithm design and complexity...
AbstractWe say that a polyhedron with 0–1 valued vertices is combinatorial if the midpoint of the li...
AbstractWe say that a polyhedron with 0–1 valued vertices is combinatorial if the midpoint of the li...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The problem of finding an extremum of a linear function over a permutation set is considered. The po...
The paper deals with a new method of solving a combinatorial problem with account for the properties...
The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and dis...
The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and dis...
The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and dis...
The work in this thesis concerns the combinatorial theory of graphs, algebraic combinatorics and dis...
AbstractPaths along faces of a polyhedron can be assimilated to paths along the branches of a tree g...
. In this paper we study a trail routing and a hamiltonian cycle in a class of grid graphs, polycube...
AbstractThere are various greedy schemas to construct a maximal path in a given input graph. Associa...
The content of the thesis is divided into two parts; graph theory and linear programming. The main r...
The domination and Hamilton circuit problems are of interest both in algorithm design and complexity...
AbstractWe say that a polyhedron with 0–1 valued vertices is combinatorial if the midpoint of the li...
AbstractWe say that a polyhedron with 0–1 valued vertices is combinatorial if the midpoint of the li...