Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Dmitry S. Malyshev"'
Publikováno v:
Optimization Letters.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54042a0008e72a5bce54d331edae872b
https://doi.org/10.1007/s11590-023-02001-z
https://doi.org/10.1007/s11590-023-02001-z
Autor:
D. B. Mokeev, Dmitry S. Malyshev
Publikováno v:
Optimization Letters. 16:481-496
We consider graphs, which and all induced subgraphs of which possess the following property: the maximum number of disjoint paths on k vertices equals the minimum cardinality of vertex sets, covering all paths on k vertices. We call such graphs Konig
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04d949df7e62a791d7fce3d495e8418c
https://doi.org/10.1007/s11590-021-01771-8
https://doi.org/10.1007/s11590-021-01771-8
Publikováno v:
Regular and Chaotic Dynamics. 25:716-728
In this paper, we study gradient-like flows without heteroclinic intersections on an $$n$$ -sphere up to topological conjugacy. We prove that such a flow is completely defined by a bicolor tree corresponding to a skeleton formed by codimension one se
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9915e62b63f3f5ef556f59d42c92e225
https://doi.org/10.1134/s1560354720060143
https://doi.org/10.1134/s1560354720060143
Publikováno v:
Arnold Mathematical Journal. 4:483-504
In the present paper we survey existing graph invariants for gradient-like flows on surfaces up to the topological equivalence and develop effective algorithms for their distinction (let us recall that a flow given on a surface is called a gradient-l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee322ed2699f4610bd4a6adf9a8b0a25
https://doi.org/10.1007/s40598-019-00103-0
https://doi.org/10.1007/s40598-019-00103-0
Publikováno v:
Discrete & Continuous Dynamical Systems - A. 38:4305-4327
Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads to \begin{
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f911ed7106da76289cf6d827e622699
https://doi.org/10.3934/dcds.2018188
https://doi.org/10.3934/dcds.2018188
Publikováno v:
Turkensteen, M, Malyshec, D, Goldengorin, B & Pardalos, P M 2017, ' The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems ', Journal of Global Optimization, vol. 68, no. 3, pp. 601-622 . https://doi.org/10.1007/s10898-016-0486-5
The tolerance of an element of a combinatorial optimization problem with respect to its optimal solution is the maximum change of the cost of the element while preserving the optimality of the given optimal solution and keeping all other input data u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b2217e2ec4d934082a054f659639d2e
https://doi.org/10.1007/s10898-016-0486-5
https://doi.org/10.1007/s10898-016-0486-5