Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
Masaaki ShimizuHiroshi NagamochiTatsuya AkutsuPublished in: BMC Bioinform. (2011)
Keyphrases
- upper and lower bounds
- upper bound
- lower bound
- spanning tree
- graph structure
- lower and upper bounds
- tree structure
- root node
- chemical compounds
- minimum cost
- graph matching
- weighted graph
- np hard
- partition function
- directed graph
- shortest path
- tight upper and lower bounds
- learning environment
- computational complexity
- data streams