自反图的分配格多态性
Distributive Lattice Polymorphism on Reflexive Graphs
摘要：
本文给出了允许分配格多态的自反图类的两个特征，并利用这些特征来解决识别问题：对于一个没有两个顶点具有相同邻域的自反图G，我们找到了一个多项式时间算法来判定G是否允许分配格多态.
英文摘要：
In this paper we give two characterisations of the class of reflexive graphs admitting distributive lattice polymorphisms and use these characterisations to address the problem of recognition: for a reflexive graph G in which no two vertices have the same neighbourhood, we find a polynomial time algorithm to decide if G admits a distributive lattice polymorphism.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
