Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut.
Yusuke IshidaYuki KatoLiang ZhaoHiroshi NagamochiTatsuya AkutsuPublished in: J. Chem. Inf. Model. (2010)
Keyphrases
- branch and bound algorithm
- maximum clique
- lower bound
- branch and bound
- upper bound
- np hard
- search tree
- optimal solution
- randomly generated
- set covering problem
- combinatorial optimization
- finding an optimal solution
- boolean satisfiability
- directed graph
- variable ordering
- haplotype inference
- subgraph isomorphism
- combinatorial problems
- planar graphs
- graph databases
- graph partitioning
- shortest path problem
- graph mining
- search space