![]() | ![]() |
2005 | ||
---|---|---|
2 | EE | Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe: Heuristic and exact algorithms for the spanning tree detection problem. Computers & OR 32: 239-255 (2005) |
1 | EE | Takeo Yamada, Kohtaro Watanabe, Seiji Kataoka: Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. J. Comput. Math. 82(1): 23-34 (2005) |
1 | Seiji Kataoka | [1] [2] |
2 | Takeo Yamada | [1] [2] |