Taku OKADA


On the Minimum Caterpillar Problem in Digraphs
Taku OKADA Akira SUZUKI Takehiro ITO Xiao ZHOU 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/03/01
Vol. E97-A  No. 3  pp. 848-857
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
bounded treewidth graphcaterpillardynamic programminggraph algorithminapproximability
 Summary | Full Text:PDF(1.1MB)