Complexity of searching for a black hole (Q5480656)
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: Complexity of searching for a black hole |
scientific article; zbMATH DE number 5043342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of searching for a black hole |
scientific article; zbMATH DE number 5043342 |
Statements
3 August 2006
0 references
approximation algorithm
0 references
black hole
0 references
graph
0 references
mobile agent
0 references
NP-hard problem
0 references
0.9383565783500672
0 references
0.9353161454200744
0 references
0.9340007305145264
0 references
0.933777153491974
0 references
0.9326083660125732
0 references
