Corrigendum to: `Complexity of diagrams' (Q1319087)
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: Corrigendum to: `Complexity of diagrams' |
scientific article; zbMATH DE number 549277
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Corrigendum to: `Complexity of diagrams' |
scientific article; zbMATH DE number 549277 |
Statements
Corrigendum to: `Complexity of diagrams' (English)
0 references
12 April 1994
0 references
Concerns the authors' paper ibid. 3, 321-330 (1987), reviewed above.
0 references
diagram
0 references
undirected graph
0 references
covering relation
0 references
finite poset
0 references
NP- completeness
0 references
0.8970786
0 references
0.88571155
0 references
0.8805317
0 references
0.86833495
0 references
0.8667799
0 references
0.8664564
0 references
0.8501444
0 references
0.8493501
0 references
