Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Zamaraev, V. A."'
Publikováno v:
In Discrete Mathematics October 2023 346(10)
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-width, the restriction
Externí odkaz:
http://arxiv.org/abs/1701.08857
Statistical uncertainty of different filtration techniques for market network analysis is studied. Two measures of statistical uncertainty are discussed. One is based on conditional risk for multiple decision statistical procedures and another one is
Externí odkaz:
http://arxiv.org/abs/1311.2273
Publikováno v:
In Discrete Applied Mathematics 30 October 2018 248:145-152
Publikováno v:
In Discrete Mathematics 6 February 2015 338(2):164-179
Publikováno v:
Acta Mathematica Universitatis Comenianae
Scopus-Elsevier
Scopus-Elsevier
We compare the minimum size of a vertex cover, feedback vertex set and odd cycle transversal of a graph with the minimum size of the corresponding variants in which the transversal must be an independent set. We investigate for which graphs H the two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::368bd8e5a9a7f2518aff2937a68ba2c2
http://livrepository.liverpool.ac.uk/3092259/1/paper44.pdf
http://livrepository.liverpool.ac.uk/3092259/1/paper44.pdf
Publikováno v:
(2019). Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence. Palo Alto, California: AAAI Press, pp. 7667-7674
Graph coloring is one of the most famous computational problems with applications in a wide range of areas such as planning and scheduling, resource allocation, and pattern matching. So far coloring problems are mostly studied on static graphs, which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______328::6d5ee45a36a1a9c52f0157e8f52d9e70
http://dro.dur.ac.uk/26802/1/26802.pdf
http://dro.dur.ac.uk/26802/1/26802.pdf
Publikováno v:
Chatzigiannakis, Ioannis & Kaklamanis, Christos & Marx, Dániel & Sannella, Don (Eds.). (2018). 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) : Prague, Czech Republic, July 9-13, 2018 ; proceedings. Dagstuhl: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 148:1-148:14, Leibniz international proceedings in informatics (LIPICS), Vol.107
Modern, inherently dynamic systems are usually characterized by a network structure, i.e. an underlying graph topology, which is subject to discrete changes over time. Given a static underlying graph G, a temporal graph can be represented via an assi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______328::ebd1cffc7404ea7ec9b7970b8aa46e02
http://dro.dur.ac.uk/24715/
http://dro.dur.ac.uk/24715/
Publikováno v:
Potapov, Igor & Spirakis, Paul & Worrell, James (Eds.). (2018). 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 63:1-63:15, Leibniz International Proceedings in Informatics(117)
Let $vc(G)$, $fvs(G)$ and $oct(G)$, respectively, denote the size of a minimum vertex cover, minimum feedback vertex set and minimum odd cycle transversal in a graph $G$. One can ask, when looking for these sets in a graph, how much bigger might they
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::964f05a8cac653380450066e03c2073c
The aspects of energy saving that arise when combining casting processes - hot metal deformation – are noted. It is shown that for the treatment of magnesium, it is preferable to use cold metal processing processes instead of hot processing process
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______917::147b36dfa97a6b8ec157091b344cf834
https://hdl.handle.net/10995/57845
https://hdl.handle.net/10995/57845