AAAAAA

   
Results: 1-13 |
Results: 13
GENERALIZED EDGE-RANKINGS OF TREES
Authors: ZHOU X KASHEM A NISHIZEKI T
Citation: X. Zhou et al., GENERALIZED EDGE-RANKINGS OF TREES, IEICE transactions on fundamentals of electronics, communications and computer science, E81A(2), 1998, pp. 310-320
AN NC PARALLEL ALGORITHM FOR EDGE-COLORING SERIES-PARALLEL MULTIGRAPHS
Authors: ZHOU X SUZUKI H NISHIZEKI T
Citation: X. Zhou et al., AN NC PARALLEL ALGORITHM FOR EDGE-COLORING SERIES-PARALLEL MULTIGRAPHS, Journal of algorithms, 23(2), 1997, pp. 359-374
A LINEAR-TIME ALGORITHM FOR 4-PARTITIONING 4-CONNECTED PLANAR GRAPHS
Authors: NAKANO S RAHMAN MS NISHIZEKI T
Citation: S. Nakano et al., A LINEAR-TIME ALGORITHM FOR 4-PARTITIONING 4-CONNECTED PLANAR GRAPHS, Information processing letters, 62(6), 1997, pp. 315-322
ON THE ONE-WAY ALGEBRAIC HOMOMORPHISM
Authors: CHIDA E NISHIZEKI T OHMORI M SHIZUYA H
Citation: E. Chida et al., ON THE ONE-WAY ALGEBRAIC HOMOMORPHISM, IEICE transactions on fundamentals of electronics, communications and computer science, E79A(1), 1996, pp. 54-60
EDGE-COLORING PARTIAL K-TREES
Authors: ZHOU X NAKANO S NISHIZEKI T
Citation: X. Zhou et al., EDGE-COLORING PARTIAL K-TREES, Journal of algorithms, 21(3), 1996, pp. 598-617
A LINEAR ALGORITHM FOR EDGE-COLORING SERIES-PARALLEL MULTIGRAPHS
Authors: ZHOU X SUZUKI H NISHIZEKI T
Citation: X. Zhou et al., A LINEAR ALGORITHM FOR EDGE-COLORING SERIES-PARALLEL MULTIGRAPHS, Journal of algorithms, 20(1), 1996, pp. 174-201
SHORTEST NONCROSSING PATHS IN PLANE GRAPHS
Authors: TAKAHASHI JY SUZUKI H NISHIZEKI T
Citation: Jy. Takahashi et al., SHORTEST NONCROSSING PATHS IN PLANE GRAPHS, Algorithmica, 16(3), 1996, pp. 339-357
ALGORITHMS FOR FINDING NONCROSSING PATHS WITH MINIMUM TOTAL LENGTH INPLANE GRAPHS
Authors: TAKAHASHI J SUZUKI H NISHIZEKI T
Citation: J. Takahashi et al., ALGORITHMS FOR FINDING NONCROSSING PATHS WITH MINIMUM TOTAL LENGTH INPLANE GRAPHS, Electronics and communications in Japan. Part 3, Fundamental electronic science, 78(4), 1995, pp. 1-15
OPTIMAL PARALLEL ALGORITHMS FOR EDGE-COLORING PARTIAL K-TREES WITH BOUNDED DEGREES
Authors: ZHOU X NISHIZEKI T
Citation: X. Zhou et T. Nishizeki, OPTIMAL PARALLEL ALGORITHMS FOR EDGE-COLORING PARTIAL K-TREES WITH BOUNDED DEGREES, IEICE transactions on fundamentals of electronics, communications and computer science, E78A(4), 1995, pp. 463-469
ONE-WAY FUNCTIONS OVER FINITE NEAR-RINGS
Authors: CHIDA E SHIZUYA H NISHIZEKI T
Citation: E. Chida et al., ONE-WAY FUNCTIONS OVER FINITE NEAR-RINGS, IEICE transactions on fundamentals of electronics, communications and computer science, E78A(1), 1995, pp. 4-10
GENERALIZED VERTEX-RANKINGS OF TREES
Authors: ZHOU X NAGAI N NISHIZEKI T
Citation: X. Zhou et al., GENERALIZED VERTEX-RANKINGS OF TREES, Information processing letters, 56(6), 1995, pp. 321-328
K-CONNECTIVITY AND DECOMPOSITION OF GRAPHS INTO FORESTS
Authors: NISHIZEKI T POLJAK S
Citation: T. Nishizeki et S. Poljak, K-CONNECTIVITY AND DECOMPOSITION OF GRAPHS INTO FORESTS, Discrete applied mathematics, 55(3), 1994, pp. 295-301
SELECTIONS FROM SIGAL INTERNATIONAL-SYMPOSIUM ON ALGORITHMS - EDITORSFOREWORD
Authors: ASANO T NISHIZEKI T
Citation: T. Asano et T. Nishizeki, SELECTIONS FROM SIGAL INTERNATIONAL-SYMPOSIUM ON ALGORITHMS - EDITORSFOREWORD, Algorithmica, 9(6), 1993, pp. 517-517
Risultati: 1-13 |