A polynomial-time algorithm for near-unanimity graphs

Authors:
Benoit Larose;Cynthia Loten;László Zádori
Affiliations:
Department of Mathematics and Statistics, Concordia University, 1455 de Maisonneuve West, Montréal, Qc, Canada, H3G 1M8;Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, B.C., Canada, V5A 1S6;Bolyai Intézet, Aradi vértanúk tere 1, H-6720, Szeged, Hungary
Venue:
Journal of Algorithms
Year:
2005

Citing 8
Cited 2

From local to global consistency

Artificial Intelligence
Graphs with edge-preserving majority functions

Discrete Mathematics
Algebraic properties and dismantlability of finite posets

Discrete Mathematics
Constraints, consistency and closure

Artificial Intelligence
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Gibbs measures and dismantlable graphs

Journal of Combinatorial Theory Series B
Classification of Homomorphisms to Oriented Cycles and of k-Partite Satisfiability

SIAM Journal on Discrete Mathematics
First-Order Definable Retraction Problems for Posets and Reflexive Graphs

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science

Survey: Colouring, constraint satisfaction, and complexity

Computer Science Review
Semilattice polymorphisms and chordal graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.