Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Victor Zamaraev"'
Autor:
Bogdan Alecu, Robert Ferguson, Mamadou Moustapha Kanté, Vadim V. Lozin, Vincent Vatter, Victor Zamaraev
Publikováno v:
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics, 2022, 36 (4), pp.2774-2797. ⟨10.1137/21M1449646⟩
SIAM Journal on Discrete Mathematics, 2022, 36 (4), pp.2774-2797. ⟨10.1137/21M1449646⟩
International audience; We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural
Autor:
Vadim V. Lozin, Victor Zamaraev
Publikováno v:
European Journal of Combinatorics. 65:143-153
We show that the number of labelled P7-free bipartite graphs with n vertices grows as nΘ(n). This resolves an open problem posed by Allen (2009), and completes the description of speeds of monogenic classes of bipartite graphs. Our solution is based
Autor:
Victor Zamaraev, Jérôme Monnot, Shahid Hussain, Bernard Ries, Vadim V. Lozin, Hassan AbouEisha
Publikováno v:
ALGORITHMICA
Algorithmica
Algorithmica, 2018, 80 (10), ⟨10.1007/s00453-017-0346-9⟩
Algorithmica
Algorithmica, 2018, 80 (10), ⟨10.1007/s00453-017-0346-9⟩
The results of this paper previously appeared as extended abstracts in proceedings of the 8th International Conference on Combinatorial Optimization and Applications, COCOA 2014, and the 27th International Workshop on Combinatorial Algorithms, IWOCA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6880f283d90292edcbb2a224ee16209
http://livrepository.liverpool.ac.uk/3059778/1/up-tcs_rev.pdf
http://livrepository.liverpool.ac.uk/3059778/1/up-tcs_rev.pdf
Autor:
Panos M. Pardalos, Alexander P. Koldanov, Valeriy A. Kalyagin, P. A. Koldanov, Victor Zamaraev
Publikováno v:
Physica A: Statistical Mechanics and its Applications. 413:59-70
A general approach to measure statistical uncertainty of different filtration techniques for market network analysis is proposed. Two measures of statistical uncertainty are introduced and discussed. One is based on conditional risk for multiple deci
Publikováno v:
DISCRETE APPLIED MATHEMATICS
© 2017 Elsevier B.V. The celebrated theorem of Robertson and Seymour states that in the family of minor-closed graph classes, there is a unique minimal class of graphs of unbounded tree-width, namely, the class of planar graphs. In the case of tree-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9eb7fb2f687b8af7419a971646c94e08
Autor:
Victor Zamaraev, Vadim V. Lozin
Publikováno v:
Journal of Graph Theory. 78:207-218
For a class of graphs X, let Xn be the number of graphs with vertex set {1,',n} in the class X, also known as the speed of X. It is known that in the family of hereditary classes i.e. those that are closed under taking induced subgraphs the speeds co
Autor:
Shahid Hussain, Bernard Ries, Hassan AbouEisha, Vadim V. Lozin, Jérôme Monnot, Victor Zamaraev
Publikováno v:
Combinatorial Algorithms. 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings
27th International Workshop on Combinatorial Algorithms, IWOCA 2016
27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.229-240, ⟨10.1007/978-3-319-44543-4_18⟩
Lecture Notes in Computer Science ISBN: 9783319445427
IWOCA
27th International Workshop on Combinatorial Algorithms, IWOCA 2016
27th International Workshop on Combinatorial Algorithms, IWOCA 2016, Aug 2016, Helsinki, Finland. pp.229-240, ⟨10.1007/978-3-319-44543-4_18⟩
Lecture Notes in Computer Science ISBN: 9783319445427
IWOCA
LNCS n°9843; International audience; An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard, but can be solved in pol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f354e36f38f50f1f87170e013d7da9c
https://hal.archives-ouvertes.fr/hal-01370014
https://hal.archives-ouvertes.fr/hal-01370014
Autor:
Panos M. Pardalos, Victor Zamaraev
This book presents recent research developments in social networks, economics, management, marketing and optimization applied to sports. The volume will be of interest to students, researchers, managers from sports, policy makers and as well athletes
Publikováno v:
JOURNAL OF GRAPH THEORY
An induced matching $M$ in a graph $G$ is dominating if every edge not in $M$ shares exactly one vertex with an edge in $M$. The dominating induced matching problem (also known as efficient edge domination) asks whether a graph $G$ contains a dominat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44ebcf9883d3bde2c93f5ad834e047e9
http://arxiv.org/abs/1505.02558
http://arxiv.org/abs/1505.02558
The idea of implicit representation of graphs was introduced in [S. Kannan, M. Naor, S. Rudich, Implicit representation of graphs, SIAM J. Discrete Mathematics, 5 (1992) 596--603] and can be defined as follows. A representation of an $n$-vertex graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb0be71e38cdefaa00f5afaabf4782ec