Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Imrich Vrto"'
Publikováno v:
Journal of Graph Theory. 83:19-33
We present two main results: a 2-page and a rectilinear drawing of the n-dimensional cube Qn. Both drawings have the same number 1257684n−2n−33(3n2+9+(−1)n+12) of crossings, even though they are given by different constructions. The first impro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57d6b88aa3fc002f8008181d20d38ce4
https://doi.org/10.1002/jgt.21910
https://doi.org/10.1002/jgt.21910
Publikováno v:
Open Computer Science, Vol 5, Iss 1, Pp 22-40 (2015)
We propose several new heuristics for the twopage book crossing problem, which are based on recent algorithms for the corresponding one-page problem. Especially, the neural network model for edge allocation is combined for the first time with various
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::db1a32ae4899ae77a67bd529022f58f0
https://doi.org/10.1515/comp-2015-0004
https://doi.org/10.1515/comp-2015-0004
Publikováno v:
Discrete Applied Mathematics. 161:1402-1408
The antibandwidth problem is to label vertices of a graph G(V,E) bijectively by integers 0,1,...,|V|-1 in such a way that the minimal difference of labels of adjacent vertices is maximized. In this paper we study the antibandwidth of Hamming graphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3b351b438b42d95f9e3f93e83d1e4f7
https://doi.org/10.1016/j.dam.2012.12.026
https://doi.org/10.1016/j.dam.2012.12.026
Autor:
Imrich Vrto, Hristo N. Djidjev
Publikováno v:
Discrete & Computational Geometry. 48:393-415
Pach and Toth proved that any n-vertex graph of genus g and maximum degree d has a planar crossing number at most c g dn, for a constant c>1. We improve on this result by decreasing the bound to O(dgn), and also prove that our result is tight within
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cac613a12bfe1d202b7c4c587c038624
https://doi.org/10.1007/s00454-012-9430-8
https://doi.org/10.1007/s00454-012-9430-8
Publikováno v:
Discrete & Computational Geometry. 44:463-483
There are three general lower bound techniques for the crossing numbers of graphs: the Crossing Lemma, the bisection method and the embedding method. In this contribution, we present their adaptations to the minor crossing number. Using the adapted b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::794f307158eb50ce9dfa4ba713fd2c58
https://doi.org/10.1007/s00454-010-9245-4
https://doi.org/10.1007/s00454-010-9245-4
Autor:
Imrich Vrto, Lubomir Torok
Publikováno v:
Discrete Mathematics. 310(3):505-510
The antibandwidth problem is to label vertices of a graph G = ( V , E ) bijectively by 1 , 2 , 3 , … , | V | such that the minimal difference of labels of adjacent vertices is maximised. In this paper we discuss the antibandwidth of three-dimension
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9fb7d8de5e5fe0b74ca7647cd1364484
Publikováno v:
Discrete Mathematics. 309:1909-1916
A current topic in graph drawing is the question how to draw two edge sets on the same vertex set, the so-called simultaneous drawing of graphs. The goal is to simultaneously find a nice drawing for both of the sets. It has been found out that only r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ad7a91a6d72edfe060c1d47763b1c44
https://doi.org/10.1016/j.disc.2008.01.033
https://doi.org/10.1016/j.disc.2008.01.033
Publikováno v:
Electronic Notes in Discrete Mathematics. 28:169-175
There are three general lower bound techniques for the crossing numbers of graphs, all of which can be traced back to Leighton's work on applications of crossing number in VLSI: the Crossing Lemma, the Bisection Method, and the Embedding Method. In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d0b170a1c7815b057ee3d4ee28d9adba
https://doi.org/10.1016/j.endm.2007.01.024
https://doi.org/10.1016/j.endm.2007.01.024
Publikováno v:
Electronic Notes in Discrete Mathematics. 22:223-227
The cyclic antibandwidth problem is to embed an n-vertex graph into the cycle C n , such that the minimum distance (measured in the cycle) of adjacent vertices is maximised. This is a variant of obnoxious facility location problems or a dual problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a84cc9978ae1f9178d6670e847914df
https://doi.org/10.1016/j.endm.2005.06.030
https://doi.org/10.1016/j.endm.2005.06.030
Publikováno v:
Electronic Notes in Discrete Mathematics. 22:527-534
The minimisation of edge crossings in a book drawing of a graph G is one of important goals for a linear VLSI design, and the two-page crossing number of a graph G provides an upper bound for the standard planar crossing number. We propose several ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7b165f0414212218fb683e7b29cedef
https://doi.org/10.1016/j.endm.2005.06.088
https://doi.org/10.1016/j.endm.2005.06.088