Letter graphs and geometric grid classes of permutations: characterization and recognition (Q5915647)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6890118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Letter graphs and geometric grid classes of permutations: characterization and recognition |
scientific article; zbMATH DE number 6890118 |
Statements
Letter graphs and geometric grid classes of permutations: characterization and recognition (English)
0 references
15 June 2018
0 references
recognition of 3-letter graphs
0 references
polynomial-time algorithm
0 references
0.9593469500541688
0 references
0.868904173374176
0 references
0.7742258906364441
0 references
0.7734967470169067
0 references
0.7375273704528809
0 references