IEICE Technical Report

Print edition: ISSN 0913-5685

Theoretical Foundations of Computing

Workshop Date : 2006-04-26 / Issue Date : 2006-04-19

COMP2006-1
Optimality of Balanced Semi-Matchings
Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)
pp. 1 - 8

COMP2006-2
Reducing L versus P to Reversal versus Access
Kenya Ueno (Univ. of Tokyo)
pp. 9 - 16

COMP2006-3
Polygonal Curve Approximation Using Grid Points with Application to a Triangular Mesh Generation with Small Number of Different Edge Lengths
Shin-ichi Tanigawa, Naoki Katoh (Kyoto Univ.)
pp. 17 - 24

COMP2006-4
Efficient Broadcasting and Gathering Algorithms on Dynamic Sensor Networks
Naoki Inaba, Jiro Uchida, Yoshiaki Katayama (Nagoya Inst. of Tech.), Wei Chen (Tennessee State Univ.), Koichi Wada (Nagoya Inst. of Tech.)
pp. 25 - 32

COMP2006-5
Searching Scale-Free Networks with Local Information
Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)
pp. 33 - 39

COMP2006-6
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity
Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa (Kyoto Univ.)
pp. 41 - 48

COMP2006-7
An Efficient Alignability Decision Algorithm for Unordered Trees
Tetsuji Kuboyama, Kilho Shin (Univ. of Tokyo)
pp. 49 - 56

COMP2006-8
A simple algorithm for testing isomorphism of chordal graphs
Seinosuke Toda (Nihon Univ.)
pp. 57 - 62

COMP2006-9
An exact algorithm for the label placement problem
Yuichi Inoue, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.)
pp. 63 - 67

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan