IEICE Trans

Yoshihiro KANEKO

The Expected Distance of Shortest Path-Based In-Trees along Spanning Root Mobility on Grid Graph Yoshihiro KANEKO
Publication: Publication Date: 2020/09/01 Vol. E103-A No. 9 pp. 1071-1077 Type of Manuscript: Special Section PAPER (Special Section on Circuits and Systems) Category: Keyword: grid graph, the shortest path, in-tree, distance, Hamilton path, Hamilton cycle,
	Summary \| Full Text:PDF(842.1KB)

An Optimal File Transfer on Networks with Plural Original Files Yoshihiro KANEKO Shoji SHINODA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2002/12/01 Vol. E85-A No. 12 pp. 2913-2922 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: file transfer, original files, single source, minimum spanning tree with degree constraints,
	Summary \| Full Text:PDF(736.3KB)

On the Optimality of Forest-Type File Transfers on a File Transmission Net Yoshihiro KANEKO Shoji SHINODA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/07/25 Vol. E83-A No. 7 pp. 1411-1419 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: file transfer, optimality, minimum cost, forest-type,
	Summary \| Full Text:PDF(419.7KB)

The Complexity of an Optimal File Transfer Problem Yoshihiro KANEKO Shoji SHINODA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/02/25 Vol. E82-A No. 2 pp. 394-397 Type of Manuscript: LETTER Category: Graphs and Networks Keyword: file transmission net, file transfer, Steiner tree, NP-complete,
	Summary \| Full Text:PDF(99.4KB)

On a Problem of Designing a 2-Switch Node Network Yoshitsugu TSUCHIYA Yoshihiro KANEKO Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/11/25 Vol. E78-A No. 11 pp. 1534-1536 Type of Manuscript: Special Section LETTER (Special Section of Letters Selected from the 1995 IEICE General Conference) Category: Keyword: 2-switch node network, traffic, terminal node, partition, NP-complete,
	Summary \| Full Text:PDF(170.6KB)

A Synthesis of a Forest-Type Optimal File Transfer on a File Transmission Net with Source Vertices Yoshihiro KANEKO Koichi SUZUKI Shoji SHINODA Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/06/25 Vol. E78-A No. 6 pp. 671-679 Type of Manuscript: Special Section PAPER (Special Section of Papers Selected from 1994 Joint Technical Conference on Circuits/Systems, Computers and Communications (JTC-CSCC '94)) Category: Keyword: vertex cost, arc cost, vertex demand, optimal file transfer, source vertex set, forest,
	Summary \| Full Text:PDF(707.4KB)

On an Optimal File Transfer on an Arborescence-Net with Constraints on Copying Numbers Yoshihiro KANEKO Shoji SHINODA Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/04/25 Vol. E78-A No. 4 pp. 517-528 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: copying cost, transmission cost, copy demand number, copying number, arborescence-net, file trasfer,
	Summary \| Full Text:PDF(1009.7KB)

On an Optimum File Transfer on a File Transmission Net Yoshihiro KANEKO Jiguang ZHANG Shoji SHINODA Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/07/25 Vol. E76-A No. 7 pp. 1133-1138 Type of Manuscript: Special Section LETTER (Special Section of Letters Selected from the 1993 IEICE Spring Conference) Category: Keyword: file transmission net, file transfer, optimal file transfer, optimum file transfer,
	Summary \| Full Text:PDF(385.7KB)

A Synthesis of an Optimal File Transfer on a File Transmission Net Yoshihiro KANEKO Shoji SHINODA Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/03/25 Vol. E76-A No. 3 pp. 377-386 Type of Manuscript: Special Section PAPER (Special Section on the 5th Karuizawa Workshop on Circuits and Systems) Category: Keyword: minimum spanning tree, shortest path, vertex cost, arc cost, vertex demand,
	Summary \| Full Text:PDF(839.4KB)

On a Realization of "Flow-Saturation" by Adding Edges in an Undirected Vertex-Capacitated Network Yoshihiro KANEKO Shoji SHINODA Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/12/25 Vol. E75-A No. 12 pp. 1785-1792 Type of Manuscript: PAPER Category: Graphs, Networks and Matroids Keyword: graphs and networks, maximum flow, edge addition, vertex-capacitated, undirected,
	Summary \| Full Text:PDF(738.8KB)

A Linear-Time Algorithm for Designing an Optimal File Transfer through an Arborescence-Net Yoshihiro KANEKO Reiko TASHIRO Shoji SHINODA Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1992/07/25 Vol. E75-A No. 7 pp. 901-904 Type of Manuscript: Special Section LETTER (Special Section on the 1992 IEICE Spring Conference) Category: Keyword: graph, arborescence, vertex demand, vertex cost, arc cost,
	Summary \| Full Text:PDF(259.5KB)

On a Problem of Realizing an Undirected Vertex-Capacitated Network--Flow-Saturated and Flow-Unsaturated-- Yoshihiro KANEKO Satoru YOSHIDA Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1991/05/25 Vol. E74-A No. 5 pp. 994-998 Type of Manuscript: Special Section LETTER (Special Issue on 1991 Spring Natl. Conv. IEICE) Category: Graphs and Networks Keyword:
	Summary \| Full Text:PDF(268.4KB)