团积带宽的锐界
Sharp Bounds for Bandwidth of Clique Products
摘要：
图的带宽是指图中具有最小最大边差的顶点的标号。对于许多图族，这是NP完全的。一个经典的结果计算带宽的超立方体。我们推广这一结果给尖锐的下限产品的集团。这个问题相当于在多个通道上进行通信的问题，其中通道可能会失败，并且通过这些通道发送的信息会丢失。目标是创建一种编码，使接收到的信息和原始信息之间的差异最小化，同时具有尽可能少的冗余。Berger-Wolf和Reingold [2]已经考虑了等大小团（或等容量信道）的问题。本文给出了任意数目任意大小团的乘积的一个紧下界和一个构造标号的算法。
英文摘要：
The bandwidth of a graph is the labeling of vertices with minimum maximum edge difference. For many graph families this is NP-complete. A classic result computes the bandwidth for the hypercube. We generalize this result to give sharp lower bounds for products of cliques. This problem turns out to be equivalent to one in communication over multiple channels in which channels can fail and the information sent over those channels is lost. The goal is to create an encoding that minimizes the difference between the received and the original information while having as little redundancy as possible. Berger-Wolf and Reingold [2] have considered the problem for the equal size cliques (or equal capacity channels). This paper presents a tight lower bound and an algorithm for constructing the labeling for the product of any number of arbitrary size cliques.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
