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…
Read the full story at arXiv cs.AI ↗
ImpactNotable 31/100
Why it mattersRule-based estimate: event keywords (+4); trust 6/10.
RegionsGlobal
Published1 d ago (Fri, 18 Sep 2026 04:00:00 GMT)
RetrievedFri, 18 Sep 2026 08:00:48 GMT via rss
ClassifiedFri, 18 Sep 2026 08:01:04 GMT by heuristic
AuthorHieu Truong Xuan, Khanh To Van