AAAAAA

   
Results: 1-22 |
Results: 22
Independent spanning trees with small depths in iterated line digraphs
Authors: Hasunuma, T Nagamochi, H
Citation: T. Hasunuma et H. Nagamochi, Independent spanning trees with small depths in iterated line digraphs, DISCR APP M, 110(2-3), 2001, pp. 189-211
Approximating the minimum k-way cut in a graph via minimum 3-way cuts
Authors: Zhao, L Nagamochi, H Ibaraki, T
Citation: L. Zhao et al., Approximating the minimum k-way cut in a graph via minimum 3-way cuts, J COMB OPTI, 5(4), 2001, pp. 397-410
Augmenting a submodular and posi-modular set function by a multigraph
Authors: Nagamochi, H Shiraki, T Ibaraki, T
Citation: H. Nagamochi et al., Augmenting a submodular and posi-modular set function by a multigraph, J COMB OPTI, 5(2), 2001, pp. 175-212
Special issue on selected papers from LA Symposium - Foreword
Authors: Moriya, E Yamashita, M Wada, K Murakami, M Watanabe, O Itoh, T Toda, S Katoh, N Iwama, K Nagamochi, H Harao, M Inoue, K Toyama, Y
Citation: E. Moriya et al., Special issue on selected papers from LA Symposium - Foreword, IEICE T INF, E84D(1), 2001, pp. 1-3
Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree
Authors: Nagamochi, H Mochizuki, K Ibaraki, T
Citation: H. Nagamochi et al., Solving the single-vehicle scheduling problems for all home locations under depth-first routing on a tree, IEICE T FUN, E84A(5), 2001, pp. 1135-1143
An efficient NC algorithm for a sparse k-edge-connectivity certificate
Authors: Nagamochi, H Hasunuma, T
Citation: H. Nagamochi et T. Hasunuma, An efficient NC algorithm for a sparse k-edge-connectivity certificate, J ALGORITHM, 38(2), 2001, pp. 354-373
Multigraph augmentation under biconnectivity and general edge-connectivityrequirements
Authors: Ishii, T Nagamochi, H Ibaraki, T
Citation: T. Ishii et al., Multigraph augmentation under biconnectivity and general edge-connectivityrequirements, NETWORKS, 37(3), 2001, pp. 144-155
Minimum cost source location problem with vertex-connectivity requirementsin digraphs
Authors: Nagamochi, H Ishii, T Ito, H
Citation: H. Nagamochi et al., Minimum cost source location problem with vertex-connectivity requirementsin digraphs, INF PROCESS, 80(6), 2001, pp. 287-293
Polyhedral structure of submodular and posi-modular systems
Authors: Nagamochi, H Ibaraki, T
Citation: H. Nagamochi et T. Ibaraki, Polyhedral structure of submodular and posi-modular systems, DISCR APP M, 107(1-3), 2000, pp. 165-189
A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
Authors: Nagamochi, H Katayama, S Ibaraki, T
Citation: H. Nagamochi et al., A faster algorithm for computing minimum 5-way and 6-way cuts in graphs, J COMB OPTI, 4(2), 2000, pp. 151-169
Optimal augmentation of a 2-vertex-connected multigraph to an l-edge-connected and 3-vertex-connected multigraph
Authors: Ishii, T Nagamochi, H Ibaraki, T
Citation: T. Ishii et al., Optimal augmentation of a 2-vertex-connected multigraph to an l-edge-connected and 3-vertex-connected multigraph, J COMB OPTI, 4(1), 2000, pp. 35-77
Recent development of graph connectivity augmentation algorithms
Authors: Nagamochi, H
Citation: H. Nagamochi, Recent development of graph connectivity augmentation algorithms, IEICE T INF, E83D(3), 2000, pp. 372-383
A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem
Authors: Nagamochi, H Seki, K Ibaraki, T
Citation: H. Nagamochi et al., A 7/3-approximation for the minimum weight 3-connected spanning subgraph problem, IEICE T FUN, E83A(4), 2000, pp. 687-691
A fast algorithm for cactus representations of minimum cuts
Authors: Nagamochi, H Nakao, Y Ibaraki, T
Citation: H. Nagamochi et al., A fast algorithm for cactus representations of minimum cuts, JPN J I A M, 17(2), 2000, pp. 245-264
A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirectedgraphs
Authors: Nagamochi, H Nakamura, S Ibaraki, T
Citation: H. Nagamochi et al., A simplified (O)over-tilde(nm) time edge-splitting algorithm in undirectedgraphs, ALGORITHMIC, 26(1), 2000, pp. 50-67
A fast algorithm for computing minimum 3-way and 4-way cuts
Authors: Nagamochi, H Ibaraki, T
Citation: H. Nagamochi et T. Ibaraki, A fast algorithm for computing minimum 3-way and 4-way cuts, MATH PROGR, 88(3), 2000, pp. 507-520
Totally balanced combinatorial optimization games
Authors: Deng, XT Ibaraki, T Nagamochi, H Zang, WN
Citation: Xt. Deng et al., Totally balanced combinatorial optimization games, MATH PROGR, 87(3), 2000, pp. 441-452
A reconfigurative algorithm for torus lightwave networks
Authors: Kato, M Kawakita, R Nagamochi, H Oie, Y
Citation: M. Kato et al., A reconfigurative algorithm for torus lightwave networks, ELEC C JP 1, 82(6), 1999, pp. 34-44
A simple proof of a minimum cut algorithm and its applications
Authors: Nagamochi, H Ishii, T Ibaraki, T
Citation: H. Nagamochi et al., A simple proof of a minimum cut algorithm and its applications, IEICE T FUN, E82A(10), 1999, pp. 2231-2236
An approximation of the minimum vertex cover in a graph
Authors: Nagamochi, H Ibaraki, T
Citation: H. Nagamochi et T. Ibaraki, An approximation of the minimum vertex cover in a graph, JPN J I A M, 16(3), 1999, pp. 369-375
Algorithmic aspects of the core of combinatorial optimization games
Authors: Deng, XT Ibaraki, T Nagamochi, H
Citation: Xt. Deng et al., Algorithmic aspects of the core of combinatorial optimization games, MATH OPER R, 24(3), 1999, pp. 751-766
Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time
Authors: Nagamochi, H Ibaraki, T
Citation: H. Nagamochi et T. Ibaraki, Augmenting edge-connectivity over the entire range in (O)over-tilde(nm) time, J ALGORITHM, 30(2), 1999, pp. 253-301
Risultati: 1-22 |