超图的笛卡尔积：性质与算法
Cartesian product of hypergraphs: properties and algorithms
摘要：
自20世纪60年代以来，图的笛卡尔积得到了广泛的研究。它们使得通过使用乘积的因子分解来降低问题的算法复杂性成为可能。超图是作为图的推广而引入的，笛卡尔积的定义自然地扩展到它们。本文给出了超图笛卡尔积染色的新性质和算法。我们还扩展了一个经典的素分解算法最初设计的图连接共形超图使用2节的超图。
英文摘要：
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product. Hypergraphs were introduced as a generalization of graphs and the definition of Cartesian products extends naturally to them. In this paper, we give new properties and algorithms concerning coloring aspects of Cartesian products of hypergraphs. We also extend a classical prime factorization algorithm initially designed for graphs to connected conformal hypergraphs using 2-sections of hypergraphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
