Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SITE, IA, IPSJ-IOT [detail] |
2021-03-02 10:45 |
Online |
Online |
Broadcasts with Tree Selection on an Overlay Network Takeshi Kaneko, Kazuyuki Shudo (TokyoTech) SITE2020-49 IA2020-45 |
On an overlay network where a number of nodes work autonomously in a decentralized way, the efficiency of broadcasts has... [more] |
SITE2020-49 IA2020-45 pp.64-71 |
CAS, MSS, IPSJ-AL [detail] |
2017-11-17 13:25 |
Tokyo |
|
Independent Spanning Trees on Pancake Graphs Daichi Matsui, Toshinori Yamada (Saitama Univ.) CAS2017-55 MSS2017-39 |
Let $G$ be a graph, and let $P$ and $P'$ be two paths connecting vertices $u$ and $v$ on $G$.
$P$ and $P'$ are said to ... [more] |
CAS2017-55 MSS2017-39 pp.105-109 |
CAS, MSS, IPSJ-AL [detail] |
2017-11-17 13:50 |
Tokyo |
|
Dynamic Compact Routing Tolerating Node Faults Yuki Takahashi, Toshinori Yamada (Saitama Univ.) CAS2017-56 MSS2017-40 |
Recently, a wireless ad hoc network(WANET) have drawn much attention, which consists only of wireless mobile devices wit... [more] |
CAS2017-56 MSS2017-40 pp.111-116 |
COMP |
2015-03-09 14:15 |
Kyoto |
Ritsumeikan University |
Maximum Supply Rate and Minimum Supply Increase Rate of Supply and Demand Networks Hironori Yoshihara, Takao Nishizeki (KGU) COMP2014-47 |
Assume that a graph $G$ has $l$ sources, each assigned a non-negative integer
called a supply, that all the vertices ot... [more] |
COMP2014-47 pp.31-37 |
COMP |
2015-03-09 16:00 |
Kyoto |
Ritsumeikan University |
On a 2-approximation Self-stabilizing Algorithm for the Maximum Leaf Spanning Tree Keisuke Okamoto, Yoshiaki Katayama (NIT) COMP2014-50 |
The maximum leaf spanning tree (MLST) is a spanning tree that has the largest possible number of leaves among all spanni... [more] |
COMP2014-50 pp.53-60 |
MoNA, AN, USN (Joint) |
2012-01-19 13:20 |
Mie |
Todaya (Toba) |
Examination of reconstruction method in wirelessmesh network usingVLAN spanning trees and virtual trunk nodes Issei Yajima, Hiroaki Morino (Shibaura Inst of Tec) AN2011-62 |
Wireless mesh networksrouting control is proposed which quikly reconstructs trees for link break among each node using V... [more] |
AN2011-62 pp.43-48 |
NS, IN (Joint) |
2010-03-04 11:10 |
Miyazaki |
Miyazaki Phoenix Seagaia Resort (Miyazaki) |
Fast Rerouting Method in Layer-2 Switches Kazuki Hamada, Katsuyoshi Takahashi, Kazuyuki Kashima (Mitsubishi Electric Corp.) IN2009-151 |
In layer-2 networks, spanning tree protocols (STP, RSTP, and MSTP) are the most popular methods to get redundancy and to... [more] |
IN2009-151 pp.43-48 |
COMP |
2010-01-25 10:05 |
Fukuoka |
Nishijin Plaza, Kyushu University |
Complexity results for the spanning tree congestion problem Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) COMP2009-40 |
We study the computational complexity of determining the \emph{spanning tree congestion} of a graph. First, we show that... [more] |
COMP2009-40 pp.9-16 |
IN, NS (Joint) |
2009-03-04 15:20 |
Okinawa |
Okinawa-Zanpamisaki Royal Hotel |
A New QoS-Aware Routing Scheme with Use of Multiple Routing Tables Naoki Kawahito, Wataru Ogasa, Yoshio Sugizaki, Saneyasu Yamaguchi, Koichi Asatani (Kogakuin Univ.) NS2008-222 |
The demands for VoIP communication is increasing. QoS-aware routing schemes are important for real-time applications suc... [more] |
NS2008-222 pp.445-450 |
COMP |
2007-09-20 13:15 |
Aichi |
|
Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP2007-35 |
Given a graph $G$ of $n$ vertices whose edge weights are
random variables and obey mutually
independent normal distri... [more] |
COMP2007-35 pp.21-27 |
COMP |
2007-05-25 14:30 |
Fukuoka |
Kyushu University |
Fixed-Parameter Tractability for Non-Crossing Spanning Trees Magnus Halldorsson (Univ. of Iceland), Christian Knauer (Freie U.), Andreas Spillner (U. East Anglia), Takeshi Tokuyama (Tohoku U) COMP2007-15 |
We consider the problem of computing non-crossing spanning trees in
topological graphs. It is known that it is NP-... [more] |
COMP2007-15 pp.25-30 |
MSS |
2005-01-27 15:40 |
Tokyo |
Univ. of Electro-Communications |
A I Clusteringethod based on Multiple Quasi-Minimum Spanning Trees Daisuke Kagawa, Morikazu Nakamura (Ryukyu Univ.), Yumiko Nakajima (Univ. of the Ryukyus) |
This paper proposes a clustering method based on multiple quasi-minimal spanning trees to obtain good quality clusters f... [more] |
CST2004-49 pp.61-65 |