k-pairs non-crossing shortest paths in a simple polygon (Q6487450)
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 7645895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | k-pairs non-crossing shortest paths in a simple polygon |
scientific article; zbMATH DE number 7645895 |
Statements
k-pairs non-crossing shortest paths in a simple polygon (English)
0 references
25 January 2023
0 references
0 references
0.9921870231628418
0 references
0.8019874095916748
0 references
0.7844915986061096
0 references
0.7786594033241272
0 references
