|
|
|
|
|
Kunihiko Hiraishi
In a previous paper by the author, a pathfinding problem for directed trees is studied under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be found by a procedure whose computational ...
ver más
|
|
|
|
|