AAAAAA

   
Results: 1-13 |
Results: 13
Finding a noncrossing Steiner forest in plane graphs under a 2-face condition
Authors: Kusakari, Y Masubuchi, D Nishizeki, T
Citation: Y. Kusakari et al., Finding a noncrossing Steiner forest in plane graphs under a 2-face condition, J COMB OPTI, 5(2), 2001, pp. 249-266
Grid drawings of 4-connected plane graphs
Authors: Miura, K Nakano, S Nishizeki, T
Citation: K. Miura et al., Grid drawings of 4-connected plane graphs, DISC COM G, 26(1), 2001, pp. 73-87
Sharing secret keys along a Eulerian circuit
Authors: Mizuki, T Shizuya, H Nishizeki, T
Citation: T. Mizuki et al., Sharing secret keys along a Eulerian circuit, ELEC C JP 3, 83(4), 2000, pp. 33-42
Graph coloring algorithms
Authors: Zhou, X Nishizeki, T
Citation: X. Zhou et T. Nishizeki, Graph coloring algorithms, IEICE T INF, E83D(3), 2000, pp. 407-417
On the average length of secret key exchange Eulerian circuits
Authors: Mizuki, T Sui, ZB Shizuya, H Nishizeki, T
Citation: T. Mizuki et al., On the average length of secret key exchange Eulerian circuits, IEICE T FUN, E83A(4), 2000, pp. 662-670
Generalized vertex-colorings of partial k-trees
Authors: Zhou, X Kanari, Y Nishizeki, T
Citation: X. Zhou et al., Generalized vertex-colorings of partial k-trees, IEICE T FUN, E83A(4), 2000, pp. 671-678
Algorithms for generalized vertex-rankings of partial k-trees
Authors: Kashem, MA Zhou, X Nishizeki, T
Citation: Ma. Kashem et al., Algorithms for generalized vertex-rankings of partial k-trees, THEOR COMP, 240(2), 2000, pp. 407-427
Box-rectangular drawings of plane graphs
Authors: Rahman, MS Nakano, S Nishizeki, T
Citation: Ms. Rahman et al., Box-rectangular drawings of plane graphs, J ALGORITHM, 37(2), 2000, pp. 363-398
A linear algorithm for finding [g, f]-colorings of partial k-trees
Authors: Zhou, X Fuse, K Nishizeki, T
Citation: X. Zhou et al., A linear algorithm for finding [g, f]-colorings of partial k-trees, ALGORITHMIC, 27(3-4), 2000, pp. 227-243
Graph algorithms and applications - Foreword
Authors: Nishizeki, T Tamassia, R Wagner, D
Citation: T. Nishizeki et al., Graph algorithms and applications - Foreword, ALGORITHMIC, 26(1), 2000, pp. 1-2
Finding edge-disjoint paths in partial k-trees
Authors: Zhou, X Tamura, S Nishizeki, T
Citation: X. Zhou et al., Finding edge-disjoint paths in partial k-trees, ALGORITHMIC, 26(1), 2000, pp. 3-30
A shortest pair of paths on the plane with obstacles and crossing areas
Authors: Kusakari, Y Suzuki, H Nishizeki, T
Citation: Y. Kusakari et al., A shortest pair of paths on the plane with obstacles and crossing areas, INT J C GEO, 9(2), 1999, pp. 151-170
Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
Authors: Zhou, X Nishizeki, T
Citation: X. Zhou et T. Nishizeki, Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings, J COMB TH B, 75(2), 1999, pp. 270-287
Risultati: 1-13 |