Solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling Problems.

arXiv:2609.20091v1 Announce Type: new Abstract: 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