Article ID Journal Published Year Pages File Type
9657015 Journal of Algorithms 2005 15 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A polynomial-time algorithm for near-unanimity graphs
Authors
, , ,