Sign in
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
Yuhei Nishiyama
Aleksandar Shurbevski
Hiroshi Nagamochi
Tatsuya Akutsu
Published in:
IEEE ACM Trans. Comput. Biol. Bioinform. (2019)
Keyphrases
</>
graph theory
significant improvement
minimum spanning tree
graph isomorphism
data structure
worst case
social networks
decision trees
objective function
query processing
computational cost
upper bound
computationally efficient
spanning tree
graph construction