IEICE Trans

Keyword : spanning tree

Broadcast with Tree Selection from Multiple Spanning Trees on an Overlay Network Takeshi KANEKO Kazuyuki SHUDO
Publication: Publication Date: 2023/02/01 Vol. E106-B No. 2 ; pp. 145-155 Type of Manuscript: PAPER Category: Network Keyword: broadcast, overlay network, path length, Plumtree, spanning tree,
	Summary \| Full Text:PDF(5.1MB)

A Polynomial-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set V_NT on Circular-Arc Graphs Shin-ichi NAKAYAMA Shigeru MASUYAMA
Publication: Publication Date: 2022/08/01 Vol. E105-D No. 8 ; pp. 1373-1382 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: spanning tree, circular-arc graph, algorithm,
	Summary \| Full Text:PDF(552.6KB)

A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set V_NT on Series-Parallel Graphs Shin-ichi NAKAYAMA Shigeru MASUYAMA
Publication: Publication Date: 2019/04/01 Vol. E102-D No. 4 ; pp. 826-835 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: spanning tree, series-parallel graph, algorithm,
	Summary \| Full Text:PDF(2.3MB)

A Linear-Time Algorithm for Finding a Spanning Tree with Non-Terminal Set V_NT on Interval Graphs Shin-ichi NAKAYAMA Shigeru MASUYAMA
Publication: Publication Date: 2018/09/01 Vol. E101-D No. 9 ; pp. 2235-2246 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: spanning tree, interval graph, algorithm,
	Summary \| Full Text:PDF(1.2MB)

A Linear Time Algorithm for Finding a Minimum Spanning Tree with Non-Terminal Set V_NT on Outerplanar Graphs Shin-ichi NAKAYAMA Shigeru MASUYAMA
Publication: Publication Date: 2017/03/01 Vol. E100-D No. 3 ; pp. 434-443 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Theoretical Computer Science —) Category: Keyword: spanning tree, outerplanar graph, algorithm,
	Summary \| Full Text:PDF(1.1MB)

A Linear Time Algorithm for Finding a Spanning Tree with Non-Terminal Set V_NT on Cographs Shin-ichi NAKAYAMA Shigeru MASUYAMA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2016/10/01 Vol. E99-D No. 10 ; pp. 2574-2584 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: spanning tree, cograph, algorithm,
	Summary \| Full Text:PDF(1.5MB)

Efficient Geometric Routing in Large-Scale Complex Networks with Low-Cost Node Design Sahel SAHHAF Wouter TAVERNIER Didier COLLE Mario PICKAVET Piet DEMEESTER
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2016/03/01 Vol. E99-B No. 3 ; pp. 666-674 Type of Manuscript: PAPER Category: Network Keyword: geometric routing, greedy forwarding, greedy embedding, spanning tree, large-scale topology, scale-free networks,
	Summary \| Full Text:PDF(1.6MB)

Load-Balanced and Interference-Aware Spanning Tree Construction Algorithm for TDMA-Based Wireless Mesh Networks Hiroshi TOKITO Masahiro SASABE Go HASEGAWA Hirotaka NAKANO
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2010/01/01 Vol. E93-B No. 1 ; pp. 99-110 Type of Manuscript: PAPER Category: Wireless Communication Technologies Keyword: wireless mesh network, spanning tree, load balance, radio interference,
	Summary \| Full Text:PDF(627.5KB)

An Optimal Parallel Algorithm for Constructing a Spanning Tree on Circular Permutation Graphs Hirotoshi HONMA Saki HONMA Shigeru MASUYAMA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/02/01 Vol. E92-D No. 2 ; pp. 141-148 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: parallel algorithms, graph algorithms, circular permutation graphs, spanning tree,
	Summary \| Full Text:PDF(615.5KB)

An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs Hirotoshi HONMA Shigeru MASUYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/09/01 Vol. E91-A No. 9 ; pp. 2296-2300 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: parallel algorithms, trapezoid graphs, spanning forest, spanning tree,
	Summary \| Full Text:PDF(300.4KB)

A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs Shin-ichi NAKAYAMA Shigeru MASUYAMA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2006/08/01 Vol. E89-D No. 8 ; pp. 2357-2363 Type of Manuscript: INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing) Category: Keyword: algorithm, vertex ranking, spanning tree, outerplanar graph,
	Summary \| Full Text:PDF(379.8KB)

Restoring Delivery Tree from Node Failures in Overlay Multicast Zongming FEI Mengkun YANG
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2005/05/01 Vol. E88-B No. 5 ; pp. 2046-2053 Type of Manuscript: PAPER Category: Network Keyword: overlay multicast, failure recovery, multimedia streaming, degree constraint, spanning tree,
	Summary \| Full Text:PDF(233.6KB)

An Algorithm for Solving the Minimum Vertex Ranking Spanning Tree Problem on Interval Graphs Shin-ichi NAKAYAMA Shigeru MASUYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/05/01 Vol. E86-A No. 5 ; pp. 1019-1026 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: algorithm, vertex ranking, spanning tree, interval graph,
	Summary \| Full Text:PDF(301.5KB)

A Share Assignment Method to Maximize the Probability of Secret Sharing Reconstruction under the Internet Ching-Yun LEE Yi-Shiung YEH Deng-Jyi CHEN Kuo-Lung KU
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/02/25 Vol. E83-D No. 2 ; pp. 190-199 Type of Manuscript: PAPER Category: Applications of Information Security Techniques Keyword: internet, secret sharing, graph theory, spanning tree, factoring, network reduction, probability,
	Summary \| Full Text:PDF(868.1KB)

Solving Multi-Objective Transportation Problem by Spanning Tree-Based Genetic Algorithm Mitsuo GEN Yinzhen LI Kenichi IDA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/12/25 Vol. E82-A No. 12 ; pp. 2802-2810 Type of Manuscript: PAPER Category: Numerical Analysis and Optimization Keyword: multi-objective optimization, transportation problem, spanning tree, genetic algorithm,
	Summary \| Full Text:PDF(596.5KB)

A Dynamic Application-Oriented Multicast Routing for Virtual-Path Based ATM Networks Byung Han RYU Masayuki MURATA Hideo MIYAHARA
Publication: IEICE TRANSACTIONS on Communications Publication Date: 1997/11/25 Vol. E80-B No. 11 ; pp. 1654-1663 Type of Manuscript: PAPER Category: Communication Networks and Services Keyword: virtual path (VP), virtual path exchange (VPX), virtual channel exchange (VCX), reduced network, spanning tree, multicast routing,
	Summary \| Full Text:PDF(972.2KB)

Cost-Radius Balanced Spanning/Steiner Trees Hideki MITSUBAYASHI Atsushi TAKAHASHI Yoji KAJITANI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1997/04/25 Vol. E80-A No. 4 ; pp. 689-694 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: delay, spanning tree, steiner tree, VLSI layout,
	Summary \| Full Text:PDF(418.3KB)