Average-case analysis of best-first search in two representative directed acyclic graphs (Q814592)
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: Average-case analysis of best-first search in two representative directed acyclic graphs |
scientific article; zbMATH DE number 5003954
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Average-case analysis of best-first search in two representative directed acyclic graphs |
scientific article; zbMATH DE number 5003954 |
Statements
Average-case analysis of best-first search in two representative directed acyclic graphs (English)
0 references
7 February 2006
0 references
Graph search
0 references
Average-case complexity
0 references
\(\text{A}^*\)
0 references
Job sequencing
0 references
Traveling salesman
0 references
0 references
0.87883264
0 references
0.8587644
0 references
0.8531313
0 references
0.8474403
0 references
0.8469033
0 references
