Art

J-GLOBAL ID：201702264817612224   Reference number：17A1149397

A dynamic programming based algorithm for enumerating unlabeled unrooted trees

動的計画法に基づく無ラベル根なし木の列挙アルゴリズム

Author (3)： MASUI RYUJI (京大) ,  SHURBEVSKI Aleksandar (京大) ,  NAGAMOCHI HIROSHI (京大)
Material： 電子情報通信学会技術研究報告  (IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
Volume： 117  Issue： 176(COMP2017 13-19)  Page： 33-40  Publication year： Aug. 11, 2017 
JST Material Number： S0532B  ISSN： 0913-5685  Document type： Proceedings
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)

Thesaurus term： *dynamic programming ,  *tree (graph) ,  *algorithm ,  vertex ,  graph theory ,  *enumeration theory ,  sequence ,  set ,  CPU time ,  tree structure ,  sequential processing ,  graph algorithm
Semi thesaurus term： Ο(n)時間 ,  ordered tree

JST classification (2)： Theory of computation  (JB02000A) ,  Mathematical programmings  (KA03030M)

Reference (15)：

• M. AMANI AND A. NOWZARI-DALINI, Generation, ranking and unranking of ordered trees with degree bounds, arXiv preprint arXiv:1603.00977, (2016).
• R. ARINGHIERI, P. HANSEN, AND F. MALUCELLI, Chemical trees enumeration algorithms, 4OR: A Quarterly Journal of Operations Research, 1 (2003), pp. 67-83.
• C. BENECKE, R. GRUND, R. HOHBERGER, A. KERBER, R. LAUE, AND T. WIELAND, Molgen+, a generator of con-nectivity isomers and stereoisomers for molecular structure elucidation, Analytica Chimica Acta, 314 (1995), pp. 141-147.
• L. C. BLUM AND J.-L. REYMOND, 970 million druglike small molecules for virtual screening in the chemical universe database gdb-13, Journal of the American Chemical Soci-ety, 131 (2009), pp.8732-8733.
• H. FUJIWARA, J. WANG, L. ZHAO, H. NAGAMOCHI, AND T. AKUTSU, Enumerating treelike chemical graphs with given path frequency, Journal of Chemical Information and Modeling, 48 (2008), pp.1345-1357.

Terms in the title (5)： 動的計画法 ,  ラベル ,  根 ,  木 ,  アルゴリズム