Back to Results
First PageMeta Content
Graph theory / Mathematics / Computational complexity theory / Operations research / Combinatorial optimization / Routing algorithms / Search algorithms / Edsger W. Dijkstra / Travelling salesman problem / A* search algorithm / Flow network / Tree traversal


Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n
Add to Reading List

Document Date: 2016-05-24 11:28:44

Open Document

File Size: 333,41 KB

Share Result on Facebook
UPDATE