Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications

by   Kyousuke Yamashita, et al.

Enumerating chemical graphs satisfying given constraints is a fundamental problem in mathematical and computational chemistry, and plays an essential part in a recently proposed framework for the inverse QSAR/QSPR. In this paper, constraints are given by feature vectors each of which consists of the frequencies of paths in a given set of paths. We consider the problem of enumerating chemical graphs that satisfy the path frequency constraints, which are given by a pair of feature vectors specifying upper and lower bounds of the frequency of each path. We design a branch-and-bound algorithm for enumerating chemical graphs of bi-block 2-augmented structure, that is, graphs that contain two edge-disjoint cycles. We present some computational experiments with an implementation of our proposed algorithm.



There are no comments yet.


page 1

page 2

page 3

page 4


Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies

We consider a problem of enumerating chemical graphs from given constrai...

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden

The parity of the length of paths and cycles is a classical and well-stu...

Path matrix and path energy of graphs

Given a graph G, we associate a path matrix P whose (i, j) entry represe...

Digraph Polynomials for Counting Cycles and Paths

Many polynomial invariants are defined on graphs for encoding the combin...

A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming

Analysis of chemical graphs is becoming a major research topic in comput...

Joint optimization of train blocking and shipment path:An integrated model and a sequential algorithm

The INFORMS RAS 2019 Problem Solving Competition is focused on the integ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.