Feasibility of motion planning on acyclic and strongly connected directed graphs (Q708329)
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: Feasibility of motion planning on acyclic and strongly connected directed graphs |
scientific article; zbMATH DE number 5798492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasibility of motion planning on acyclic and strongly connected directed graphs |
scientific article; zbMATH DE number 5798492 |
Statements
Feasibility of motion planning on acyclic and strongly connected directed graphs (English)
0 references
11 October 2010
0 references
motion planning
0 references
feasibility
0 references
acyclic directed graphs
0 references
strongly connected directed graphs
0 references
0.9136738181114196
0 references
0.7696243524551392
0 references
0.7311132550239563
0 references
0.7219225168228149
0 references
