The complexity of cover graph recognition for some varieties of finite lattices (Q1908932)
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: The complexity of cover graph recognition for some varieties of finite lattices |
scientific article; zbMATH DE number 852895
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of cover graph recognition for some varieties of finite lattices |
scientific article; zbMATH DE number 852895 |
Statements
The complexity of cover graph recognition for some varieties of finite lattices (English)
0 references
5 May 1996
0 references
finite lattice
0 references
expander graph
0 references
decision problem
0 references
cover graph
0 references
NP-complete
0 references
0 references
