海量图书期刊资源,随时随地畅享阅读乐趣
Maximum flows in probabilistic networksHiroshi Nagamochi; Toshihide Ibaraki · 1991
Minmax subtree cover problem on cactiHiroshi Nagamochi; Taizo Kawada · 2006
Two equivalent measures on weighted hypergraphsHiro Ito; Hiroshi Nagamochi · 2006
Network design with weighted degree constraintsTakuro Fukunaga; Hiroshi Nagamochi · 2010
Minimum cost subpartitions in graphsHiroshi Nagamochi; Yoko Kamidoi · 2007
A note on minimizing submodular functionsHiroshi Nagamochi; Toshihide Ibaraki · 1998
Minimum Degree OrderingsHiroshi Nagamochi · 2010
Editorial: ISAAC 2008 Special IssueSeok-Hee Hong; Hiroshi Nagamochi · 2011