The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944)
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: The summation and bottleneck minimization for single-step searching on weighted graphs |
scientific article; zbMATH DE number 484081
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The summation and bottleneck minimization for single-step searching on weighted graphs |
scientific article; zbMATH DE number 484081 |
Statements
The summation and bottleneck minimization for single-step searching on weighted graphs (English)
0 references
13 January 1994
0 references
single-step graph
0 references
searching problem
0 references
\(NP\)-hard
0 references
summation cost minimization
0 references
bottleneck cost minimization
0 references
trees
0 references
0 references
0.90156955
0 references
0.87071383
0 references
0 references
0.85228944
0 references
0.8516561
0 references
0.85006964
0 references
0.85006964
0 references
