Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms (Q4210143)
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: Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms |
scientific article; zbMATH DE number 1200783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms |
scientific article; zbMATH DE number 1200783 |
Statements
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms (English)
0 references
21 September 1998
0 references
algorithms
0 references
antichains
0 references
chains
0 references
orders
0 references
point sets
0 references
skeletons
0 references
Young tableaux
0 references
0.8722669
0 references
0.87137777
0 references
0.8704735
0 references
0.8704735
0 references
0.8670422
0 references
0.86624396
0 references
0.8613683
0 references
0.85882765
0 references
0.8586717
0 references
0.85718185
0 references
