SOURCE-LINKED INTELLIGENCE
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 fixed and the objective is to minimize the label span, has received comparatively little attention. In this paper, we consider this complementary perspective by introducing the Minimum Span Antibandwid
Read original source ↗ Open in workspace
- recordType
- paper
- region
- Global
Evidence & attribution
- arXiv · AI, language, vision and robotics · 2026-09-17T11:54:06.000Z
- arXiv · Artificial Intelligence · 2026-09-17T11:54:06.000Z
First collected: 2026-09-19T20:26:32.566Z. This is not the publication date.