Keyword : exact algorithms


Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem
Mohd SHAHRIZAN OTHMAN Aleksandar SHURBEVSKI Hiroshi NAGAMOCHI 
Publication:   
Publication Date: 2018/03/01
Vol. E101-D  No. 3 ; pp. 611-612
Type of Manuscript:  Special Section LETTER (Special Section on Foundations of Computer Science — Frontiers of Theoretical Computer Science —)
Category: 
Keyword: 
bipartite traveling salesman problemexact algorithmspolynomial spacedivide-and-conquerStirling's formula
 Summary | Full Text:PDF(73.2KB)

Some Reduction Procedure for Computing Pathwidth of Undirected Graphs
Masataka IKEDA Hiroshi NAGAMOCHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2015/03/01
Vol. E98-D  No. 3 ; pp. 503-511
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---)
Category: 
Keyword: 
pathwidthexact algorithmsgraphschemical graphs
 Summary | Full Text:PDF(1MB)

Exact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3
Mingyu XIAO Hiroshi NAGAMOCHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2013/03/01
Vol. E96-D  No. 3 ; pp. 408-418
Type of Manuscript:  Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —)
Category: 
Keyword: 
edge dominating setsexact algorithmscubic graphs
 Summary | Full Text:PDF(337.9KB)