#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1965

2018

- This year (0)
- Last 5 years (22)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Feng Bao, Yutaka Funyu, Yukihiro Hamada, Yoshihide Igarashi
- Proceedings of the International Symposium on…
- 1997

Let T/sub 1/, /spl middot//spl middot//spl middot/, T/sub n/ be n spanning trees rooted at node r of graph G. If for any node /spl nu/ of G, among the n paths from r to /spl nu/, each path in each… (More)

- Feng Bao, Yoshihide Igarashi, Sabine R. Öhring
- Discrete Applied Mathematics
- 1995

We investigate the reliability of broadcasting in product networks containing faulty nodes and/or links. Faults considered in this paper are mainly of the Byzantine type, i.e., a faulty node or a… (More)

- Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi
- COCOON
- 1997

A chordal ring, denoted by CR(N, d), is a graph G = (V, E) with V = {0,1,..., N − 1} and E = {(u, v) | [v − u]N = 1 or d}, where 2 ≤ < N ≤ N/2 and [r]N denotes r modulo N. We show that for 2 ≤ d ≤… (More)

- Kazuhiro Sado, Yoshihide Igarashi
- J. Parallel Distrib. Comput.
- 1986

For each value to be sorted in the process of the parallel bubble sort computation, we evaluate the exact time necessary to route the value to its final position. Using this evaluation we design some… (More)

A graph G is called an n-channel graph at vertex r if there are n independent spanning trees rooted at r. A graph G is called an n-channel graph if for every vertex u, G is an n-channel graph at u.… (More)

- Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura
- J. Parallel Distrib. Comput.
- 1994

We discuss the fault tolerance of an information disseminating scheme in a processor network called a binary jumping network. The following results are shown. Let N be the number of processors in the… (More)

- Masataka Takamura, Yoshihide Igarashi
- COCOON
- 2003

Group mutual exclusion is an interesting generalization of the mutual exclusion problem. This problem was introduced by Joung, and some algorithms for the problem have been proposed by incorporating… (More)

- Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi
- ISAAC
- 2000

We propose the problem of how to transmit an information-theoretically secure bit using random deals of cards among players in hierarchical groups and a computationally unlimited eavesdropper. A… (More)