Solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling Problems
The Antibandwidth and Cyclic Antibandwidth problems are NP-hard graph labeling problems that aim to maximize the minimum (cyclic) distance between labels assigned to adjacent vertices. Extensive research on these problems has resulted in a variety of mathematical formulations and computational approaches. However, their minimum span perspective, in which a prescribed minimum (cyclic) distance is…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
