IEICE Technical Report

Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2008-05-13 / Issue Date : 2008-05-06

COMP2008-8
NP-Hardness of the Sorting Buffer Problem on the Unifrom Metric
Yuichi Asahiro (Kyushu Sangyo Univ.), Kenichi Kawahara, Eiji Miyano (Kyushu Inst of Tech)
pp. 1 - 8

COMP2008-9
Minimum Energy Broadcasting on Wireless Networks in Manhattan Model
Toshinori Yamada (Saitama Univ.)
pp. 9 - 16

COMP2008-10
GMDH-type neural network algorithm self-selecting optimum neural network architecture and its application to medical image recognition
Tadashi Kondo (Tokushima Univ.)
pp. 17 - 24

COMP2008-11
NP-Completeness of Planar n/k-Coloring Problems for n/k Between 3 and 4
Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.)
pp. 25 - 32

COMP2008-12
On Necessary Conditions of Linear Cover Time Random Walks
Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyusyu Univ)
pp. 33 - 36

COMP2008-13
Improved approximation of the Largest common Sub-tree of Two Unordered Trees of Bounded Height
Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII)
pp. 37 - 42

COMP2008-14
An O(n^{1.75})-time Algorithm for L(2,1)-labeling of Trees
Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. of Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Prefecture Univ.)
pp. 43 - 50

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