Keyword : computational experiments


A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
Etsuji TOMITA Yoichi SUTANI Takanori HIGASHI Mitsuo WAKATSUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/06/01
Vol. E96-D  No. 6 ; pp. 1286-1298
Type of Manuscript:  PAPER
Category: Fundamentals of Information Systems
Keyword: 
maximum cliquebranch-and-boundapproximate coloringcomputational experiments
 Summary | Full Text:PDF(791.5KB)

Performance Comparison of Algorithms for the Dynamic Shortest Path Problem
Satoshi TAOKA Daisuke TAKAFUJI Takashi IGUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2007/04/01
Vol. E90-A  No. 4 ; pp. 847-856
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
networksshortest pathsdynamic algorithmsstatic algorithmscomputational experiments
 Summary | Full Text:PDF(1.5MB)