Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs (Q2236638)
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: Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs |
scientific article; zbMATH DE number 7413830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs |
scientific article; zbMATH DE number 7413830 |
Statements
Non-crossing monotone paths and binary trees in edge-ordered complete geometric graphs (English)
0 references
25 October 2021
0 references
edge-ordered graph
0 references
monotone non-crossing path
0 references
monotone non-crossing complete binary tree
0 references
0 references
0.8334541320800781
0 references
0.8326244950294495
0 references
0.8207558989524841
0 references
0.7930534482002258
0 references
0.7896668910980225
0 references
