Minimum linear arrangement of incomplete hypercubes
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F15%3A43924763" target="_blank" >RIV/49777513:23520/15:43924763 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1093/comjnl/bxu031" target="_blank" >http://dx.doi.org/10.1093/comjnl/bxu031</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1093/comjnl/bxu031" target="_blank" >10.1093/comjnl/bxu031</a>
Alternative languages
Result language
angličtina
Original language name
Minimum linear arrangement of incomplete hypercubes
Original language description
The minimum linear arrangement problem is a combinatorial optimization problem whose goal is to find a linear layout of a network in such way that a certain objective cost function is optimized. In this paper, we compute the minimum linear arrangement ofincomplete hypercubes using graph embeddings.
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
2
Country of publishing house
GB - UNITED KINGDOM
Number of pages
7
Pages from-to
331-337
UT code for WoS article
—
EID of the result in the Scopus database
—