Solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling Problems
Quick summary
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 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 fixed and the objective is to minimize the label span, has received comparatively little attention. In this paper, we consider this complementary perspec
Key takeaways
- 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 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 fixed and the objective is to minimize the label span, has received comparatively little attention.
Why it matters
“Solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling Problems” highlights the need for repeatable measurement rather than a single impressive demonstration. Independent validation across datasets and clearly stated limitations determine whether a result can guide product decisions.
Member comments