Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent (Q4899839)
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: Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent |
scientific article; zbMATH DE number 6123978
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent |
scientific article; zbMATH DE number 6123978 |
Statements
Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent (English)
0 references
10 January 2013
0 references
complexity
0 references
polynomial time
0 references
exponential time
0 references
adjacency matrix
0 references
