A polynomial-time algorithm for near-unanimity graphs (Q3022752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial-time algorithm for near-unanimity graphs |
scientific article; zbMATH DE number 2184161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for near-unanimity graphs |
scientific article; zbMATH DE number 2184161 |
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
