A lower bound for dilation of an embedding
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43927845" target="_blank" >RIV/49777513:23520/15:43927845 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1093/comjnl/bxv021" target="_blank" >http://dx.doi.org/10.1093/comjnl/bxv021</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/comjnl/bxv021" target="_blank" >10.1093/comjnl/bxv021</a>
Alternative languages
Result language
angličtina
Original language name
A lower bound for dilation of an embedding
Original language description
Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we introduce a technique to obtain a lower bound for dilation of an embedding. Moreover, we give algorithms to compute exact dilation of embedding circulant network into a triangular grid, Tower of Hanoi graph and Sierpinski gasket graph.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
COMPUTER JOURNAL
ISSN
0010-4620
e-ISSN
—
Volume of the periodical
58
Issue of the periodical within the volume
12
Country of publishing house
GB - UNITED KINGDOM
Number of pages
3
Pages from-to
3271-3278
UT code for WoS article
000366469000004
EID of the result in the Scopus database
—