Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
Ishida Y, Zhao L, Nagamochi H, Akutsu T.
Ishida Y, et al. Among authors: nagamochi h.
Genome Inform. 2008;21:53-64.
Genome Inform. 2008.
PMID: 19425147
Free article.
Recently, Fujiwara et al. (2008) showed two formulations and for each of them, they gave a branch-and-bound algorithm, which combined efficient enumeration of non-isomorphic trees with bounding operations based on the path frequency and the atom-atom bonds to avoid the generation …
Recently, Fujiwara et al. (2008) showed two formulations and for each of them, they gave a branch-and-bound algorithm, which combined effici …