No.1644
—ρ‹“–β‘θ‚Ι‘Ξ‚·‚ιŒvŽZ‚̍‚‘¬‰»‚Ζ‰ΒŽ‹‰»
Acceleration and Visualization of Computation for Enumeration Problems
RIMS Œ€‹†W‰ο•ρW
@
2008/09/29`2008/09/30
‰iŽ@m
Hiroshi Nagamochi
@
–ځ@ŽŸ
@
1. MultiPlane Framework for Visualisation and Analysis of Large and Complex Networks (Acceleration and Visualization of Computation for Enumeration Problems)---1
@@@@School of Information Technologies, University of Sydney@@@Hong,Seok-Hee
@
2. VAULT : Visualization and Analysis Utility for Large Tree structure (Acceleration and Visualization of Computation for Enumeration Problems)---12
@@@@“ϊ–{Œ΄Žq—ΝŒ€‹†ŠJ”­‹@\ƒVƒXƒeƒ€ŒvŽZ‰ΘŠwƒZƒ“ƒ^[@@@‹{‘Ί _Žq@(Miyamura,Hiroko)
@
3. Classification by Ordering Data Samples (Acceleration and Visualization of Computation for Enumeration Problems)-----------------20
@@@@ΞŠͺκC‘εŠw—HŠw•” / / ‹ž“s‘εŠwξ•ρŠwŒ€‹†‰Θ@@@Œ΄Œϋ ˜a–η / / ‰iŽ m@(Haraguchi,Kazuya / Hong,Seok-Hee / Nagamochi,Hiroshi)
@
4. Genome Homology Visualization by Short Similar Substring Enumeration (Acceleration and Visualization of Computation for Enumeration Problems)---35
@@@@‘—§ξ•ρŠwŒ€‹†Š@@@‰F–μ ‹B–Ύ@(Uno,Takeaki)
@
5. Investigating Web Structure by Cliques and Stars (Acceleration and Visualization of Computation for Enumeration Problems)--------44
@@@@‘εγ•{—§‘εŠw—ŠwŒnŒ€‹†‰Θ / ‘εγ•{—§‘εŠw—ŠwŒnŒ€‹†‰Θ / ‘εγ•{—§‘εŠw—ŠwŒnŒ€‹†‰Θ@@@‰F–μ —T”V / ΄’J —³–η / ¬ŒI Žj–ν@(Uno,Yushi / Kiyotani,Tatsuya / Oguri,Fumiya)
@
6. Listing All Trees with Specified Degree Sequence (Acceleration and Visualization of Computation for Enumeration Problems)--------55
@@@@ŒQ”n‘εŠwHŠw•”@@@’†–μ αΑˆκ@(Nakano,Shin-ichi)
@
7. Enumeration of Graph Sandwiches (Acceleration and Visualization of Computation for Enumeration Problems)-------------------------63
@@@@‹ž“s‘εŠw”—‰πΝŒ€‹†Š@@@—ˆ“ˆ GŽ‘@(Kijima,Shuji)
@
8. Enumerations of Non-crossing Geometric Graphs (Acceleration and Visualization of Computation for Enumeration Problems)-----------73
@@@@‹ž“s‘εŠwHŠwŒ€‹†‰Θ / ‹ž“s‘εŠwHŠwŒ€‹†‰Θ@@@‰Α“‘ ’ΌŽχ / ’Jμ αΑˆκ@(Katoh,Naoki / Tanigawa,Shin-ichi)
@
9. Enumeration of Perfect Sequences of Chordal Graph (Acceleration and Visualization of Computation for Enumeration Problems)-------86
@@@@“ŒŠC‘εŠw—Šw•” / –k—€ζ’[‰ΘŠw‹Zp‘εŠw‰@‘εŠwξ•ρ‰ΘŠwŒ€‹†‰Θ / ‘—§ξ•ρŠwŒ€‹†Š@@@Όˆδ ‘ΧŽq / γŒ΄ —²•½ / ‰F–μ ‹B–Ύ@(Matsui,Yasuko / Uehara,Ryuhei / Uno,Takeaki)
@
10. A Two-level Algorithm for Generating Multiset Permutations (Acceleration and Visualization of Computation for Enumeration Problems)---95
@@@@Department of Computer Science, University of Canterbury@@@‚‰ͺ ’‰—Y@(Takaoka,Tadao)
@
11. Detection and Enumeration of Steady States in Biological Information Networks (Acceleration and Visualization of Computation for Enumeration Problems)---110
@@@@‹ž“s‘εŠw‰»ŠwŒ€‹†ŠƒoƒCƒIƒCƒ“ƒtƒHƒ}ƒeƒBƒNƒXƒZƒ“ƒ^[@@@ˆ’‹v’Γ ’B–η@(Akutsu,Tatsuya)
@
12. “ρ•ͺƒ^ƒ“ƒOƒ‹ƒOƒ‰ƒ€‚Μ•`‚«•ϋ (—ρ‹“–β‘θ‚Ι‘Ξ‚·‚ιŒvŽZ‚̍‚‘¬‰»‚Ζ‰ΒŽ‹‰»)--------------------------------------------------------------120
@@@@“Œ‹žH‹Ζ‘εŠwξ•ρ—HŠwŒ€‹†‰Θ@@@‰ͺ–{ ‹g‰›@(Okamoto,Yoshio)
@
13. Reconstruction of Connected Interval Graphs (Acceleration and Visualization of Computation for Enumeration Problems)-----------128
@@@@–k—€ζ’[‰ΘŠw‹Zp‘εŠw‰@‘εŠwξ•ρ‰ΘŠwŒ€‹†‰Θ / –k—€ζ’[‰ΘŠw‹Zp‘εŠw‰@‘εŠwξ•ρ‰ΘŠwŒ€‹†‰Θ / –k—€ζ’[‰ΘŠw‹Zp‘εŠw‰@‘εŠwξ•ρ‰ΘŠwŒ€‹†‰Θ@@@΄Œ© —η / Φ“‘ ŽυŽχ / γŒ΄ —²•½@(Kiyomi,Masashi / Saitoh,Toshiki / Uehara,Ryuhei)
@
14. Polygons Folding to Plural Incongruent Orthogonal Boxes (Acceleration and Visualization of Computation for Enumeration Problems)---135
@@@@’}”g‘εŠwƒVƒXƒeƒ€ξ•ρHŠwŒ€‹†‰Θ / –k—€ζ’[‰ΘŠw‹Zp‘εŠw‰@‘εŠwξ•ρ‰ΘŠwŒ€‹†‰Θ@@@ŽO’J ƒ / γŒ΄ —²•½@(Mitani,Jun / Uehara,Ryuhei)
@