Nagamochi H.

H. Nagamochi

Information about the author H. Nagamochi will soon be added to the site.
Found 2 papers in total
A fast algorithm for computing minimum 3-way and 4-way cuts
2000
For an edge-weighted graph G with n vertices and m edges, we present a new...
Totally balanced combinatorial optimization games
2000
Combinatorial optimization games deal with cooperative games for which the value of...
Papers per page: