Information and Systems-Theoretical Foundations of Computing(Date:2006/03/15)

Presentation
表紙

,  

[Date]2006/3/15
[Paper #]
目次

,  

[Date]2006/3/15
[Paper #]
A polynomial time algorithm for finding a minimum weighted maximal independent set in weighted chordal graph

Ryosuke KONDO,  

[Date]2006/3/15
[Paper #]COMP2005-57
On Efficient Clustering Algorithms for Dynamic Wireless Ad-hoc Networks with Considering Mergence and Partition of Clusters.

Shintaro MIYANAGA,  Yoshiaki KATAYAMA,  Koichi WADA,  Naohisa TAKAHASHI,  Motonari KOBAYASHI,  Masanori MORITA,  

[Date]2006/3/15
[Paper #]COMP2005-58
Approximability and Non-approximability of the Minimum Block Transfer Problem

Yuichi ASAHIRO,  Tetsuya FURUKAWA,  Keiichi IKEGAMI,  Eiji MIYANO,  

[Date]2006/3/15
[Paper #]COMP2005-59
Experimental analyses of approximation algorithms for the maximum weighted independent set problem on d-claw free graphs

Yota OTACHI,  Koichi YAMAZAKI,  

[Date]2006/3/15
[Paper #]COMP2005-60
Canonical Tree Representation of Distance Hereditary Graphs with Applications

Ryuhei UEHARA,  Takeaki UNO,  

[Date]2006/3/15
[Paper #]COMP2005-61
HITS on Today's Web

Yu TEZUKA,  Yasuhito ASANO,  Takao NISHIZEKI,  

[Date]2006/3/15
[Paper #]COMP2005-62
コンピュテーション研究専門委員会からのお知らせ

,  

[Date]2006/3/15
[Paper #]
複写される方へ

,  

[Date]2006/3/15
[Paper #]
奥付

,  

[Date]2006/3/15
[Paper #]