Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Sergej L. Bezrukov"'
Autor:
Sergej L. Bezrukov
Publikováno v:
Combinatorics, Probability and Computing. 3:27-38
We consider the oriented binary tree and the oriented hypercube. The tree edges are oriented from the root to the leaves, while the orientation of the cube edges is induced by the direction from 0 to 1 in the coordinatewise form. The problem is to em
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47dfe33eed2d947195d369255dad6bf6
https://doi.org/10.1017/s0963548300000948
https://doi.org/10.1017/s0963548300000948
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783540667315
WG
WG
In this paper we introduce a new order on the set of n- dimensional tuples and prove that this order preserves nestedness in the edge isoperimetric problem for the graph Pn, defined as the nth cartesian power of the well-known Petersen graph. Thus, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ccb18da8dfcdd44c2c8c570bfab7a488
https://doi.org/10.1007/3-540-46784-x_23
https://doi.org/10.1007/3-540-46784-x_23
Publikováno v:
Mathematical Foundations of Computer Science 1998 ISBN: 9783540648277
MFCS
MFCS
We consider one-to-one embeddings of the n-dimensional hypercube into grids with 2n vertices and present lower and upper bounds and asymptotic estimates for minimal dilation, edge-congestion, and their mean values. We also introduce and study two new
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc70fe88c6002edefd6d81bdd59c0f0e
https://doi.org/10.1007/bfb0055820
https://doi.org/10.1007/bfb0055820
Autor:
Mauro Ottaviani, Alberto Marchetti-Spaccamela, Sergej L. Bezrukov, Fabrizio d'Amore, Ulf-Peter Schroeder, Markus Röttger, Luca Becchetti, Robert Preis
Publikováno v:
Euro-Par'97 Parallel Processing ISBN: 9783540634409
Euro-Par
Scopus-Elsevier
Euro-Par
Scopus-Elsevier
We consider the problem of constructing embeddings of 2-dimensional FEM graphs into grids. Our goal is to minimize the edge-congestion and dilation and optimize the load. We introduce some heuristics, analyze their performance, and present experiment
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b563850fdb05aa11f53e062a292be41
http://hdl.handle.net/11573/208872
http://hdl.handle.net/11573/208872
Autor:
Sergej L. Bezrukov
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783540625599
WG
WG
Let an edge cut partition the vertex set of the n-cube into κ subsets A1,..., A k with ∥Ai¦ — ¦Aj∥ ⩽ 1. We consider the problem to determine minimal size of such a cut and present its asymptotic as n, k → ∞ and also as n → ∞ and k
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::184f70f6f292ad212d5559f73171a47a
https://doi.org/10.1007/3-540-62559-3_5
https://doi.org/10.1007/3-540-62559-3_5
Publikováno v:
Combinatorics and Computer Science ISBN: 9783540615767
Combinatorics and Computer Science
Combinatorics and Computer Science
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree of a graph is one for which the maximal distance to all other spanning tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc68663ba51663c9cab8066afc2965d1
https://doi.org/10.1007/3-540-61576-8_73
https://doi.org/10.1007/3-540-61576-8_73