Abstract The Cyclic Bandwidth Problem is an important graph labeling problem with
numerous applications. This work aims to advance the state-of-the-art of practically solving …

Getting a labelling of vertices close to the structure of the graph has been proved to be of
interest in many applications, eg to follow signals indexed by the vertices of the network …

Abstract The Cyclic Bandwidth (CB) problem for graphs consists in labeling the vertices of a
guest graph G by distinct vertices of a host cycle C n (both of order n) in such a way that the …

The cyclic bandwidth problem (CBP) was initially introduced in the context of designing ring
interconnection networks and has a number of other relevant applications, such as the …

Getting a labeling of vertices close to the structure of the graph has been proved to be of
interest in many applications eg, to follow smooth signals indexed by the vertices of the …

We discuss a branch and bound algorithm for global optimization of NP-hard problems
related to robust stability. This includes computing the distance to instability of a system with …

This work is dedicated to a study of the NP-hard Cyclic Bandwidth Problem with the
paradigm of memetic algorithms. To find out how to choose or design a suitable …

Optimization is a discipline that addresses the search for the best possible solution, called
the optimal solution, to a problem mathematically modeled. These problems can be …

The cyclic bandwidth sum problem (CBSP) consists of finding a labeling of the vertices of an
undirected and unweighted graph with a fixed number of vertices with distinct integers such …

This thesis considers two graph layout problems: the cyclic bandwidth problem (CBP) and
the minimum linear arrangement problem (MinLA). The CBP is a natural extension of the …