A polynomial-time algorithm for near-unanimity graphs (Q3022752)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial-time algorithm for near-unanimity graphs |
scientific article |
Statements
A polynomial-time algorithm for near-unanimity graphs (English)
0 references
30 June 2005
0 references
Near-unanimity operation
0 references
Reflexive graph
0 references
Polynomial-time algorithm
0 references
