Print edition: ISSN 0913-5685
Online edition: ISSN 2432-6380
[TOP] | [2006] | [2007] | [2008] | [2009] | [2010] | [2011] | [2012] | [Japanese] / [English]
COMP2005-57
A polynomial time algorithm for finding a minimum weighted maximal independent set in weighted chordal graph
Ryosuke Kondo (T.I.T)
pp. 1 - 8
COMP2005-58
On an Efficient Clustering Algorithm for Dynamic Sensor Networks with Considering Mergence and Partition of Clusters
Shintaro Miyanaga, Yoshiaki Katayama, Koichi Wada, Naohisa Takahashi (NIT), Motonari Kobayashi, Masanori Morita (NTT DoCoMo,Inc.)
pp. 9 - 16
COMP2005-59
Approximability and Non-approximability of the Minimum Block Transfer Problem
Yuichi Asahiro (Kyushu Sangyo Univ.), Tetsuya Furukawa (Kyushu Univ.), Keiichi Ikegami, Eiji Miyano (Kyushu Inst. of Tech.)
pp. 17 - 24
COMP2005-60
Experimental analyses of approximation algorithms for the maximum weighted independent set problem on d-claw free graphs
Yota Otachi, Koichi Yamazaki (Gunma Univ.)
pp. 25 - 30
COMP2005-61
Canonical Tree Representation of Distance Hereditary Graphs with Applications
Ryuhei Uehara (JAIST), Takeaki Uno (NII)
pp. 31 - 36
COMP2005-62
HITS on Today's Web
Yu Tezuka, Yasuhito Asano, Takao Nishizeki (Tohoku Univ.)
pp. 37 - 44