Header menu link for other important links
Minimum Linear Arrangement of Incomplete Hypercubes
Miller, Mirka, Miller M, , Parthiban N,
Published in Oxford University Press (OUP)
Volume: 58
Issue: 2
Pages: 331 - 337
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 of incomplete hypercubes using graph embeddings. © 2014 The British Computer Society. All rights reserved.
About the journal
JournalData powered by TypesetThe Computer Journal
PublisherData powered by TypesetOxford University Press (OUP)
Open Access0