Computing simple paths among obstacles (Q1594600)
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: Computing simple paths among obstacles |
scientific article; zbMATH DE number 1560703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing simple paths among obstacles |
scientific article; zbMATH DE number 1560703 |
Statements
Computing simple paths among obstacles (English)
0 references
10 April 2001
0 references
simple path
0 references
NP-completeness
0 references
simple polygon
0 references
0.8688645958900452
0 references
0.8478627800941467
0 references
0.8339466452598572
0 references
0.8327662348747253
0 references
0.8251103162765503
0 references
