Minimum Linear Arrangement of Incomplete Hypercubes

Minimum Linear Arrangement of Incomplete Hypercubes

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer journal 2015-02, Vol.58 (2), p.331-337
Hauptverfasser: Miller, Mirka, Rajan, R Sundara, Parthiban, N, Rajasingh, Indra
Format: Artikel
Sprache:eng
Schlagworte:
Combinatorial analysis
Cost function
Geometry
Graph theory
Graphs
Hypercubes
Mathematical functions
Network flow problem
Networks
Optimization
Optimization algorithms
Positioning
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0010-4620
1460-2067
DOI:10.1093/comjnl/bxu031