{
  "id": 8148343,
  "title": "Solving Minimum Span Antibandwidth and Cyclic Antibandwidth Labeling Problems",
  "url": "https://urgent.news/2026/09/17/solving-minimum-span-antibandwidth-and-cyclic-antibandwidth-labeling",
  "topic": "science",
  "section": "Science",
  "published": "2026-09-17T11:54:06.000Z",
  "source": {
    "name": "arXiv cs.AI",
    "slug": "arxiv-cs-ai",
    "url": "https://arxiv.org/abs/2609.20091v1"
  },
  "original_language": "en",
  "account": null,
  "summary": "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…",
  "key_points": [],
  "editors_take": null,
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}