A polynomial-time algorithm for near-unanimity graphs

Benoit Larose,Cynthia Loten,László Zádori

Journal of Algorithms（2005）

引用 14|浏览0

暂无评分

摘要

We present a simple polynomial-time algorithm that recognises reflexive, symmetric graphs admitting a near-unanimity operation. Several other characterisations of these graphs are also presented.

查看译文

关键词

simple polynomial-time algorithm,near-unanimity operation,near-unanimity graph,recognises reflexive,reflexive graph,symmetric graph,polynomial-time algorithm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要