Decision problem for minimum interconnection trees in multipartite graphs is NP-complete but FPT in number of parts and polynomial-time on complete, quasi-complete, and t-quasi-complete graphs.
Computational Generation of Substrate-Specific Molecular Cages
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, we propose a method to build molecular cages designed to capture a specific substrate. We model a cage as a graph of atoms with coordinates in space, and several constraints on their edges (degree, length and angle). We use a simple method to place binding patterns which are able to interact with certain parts of the substrate. We then propose an algorithm which considers all possible ways of connecting these binding patterns and try to construct the smallest possible molecular paths realizing these connections. We investigate many variants of our method in order to obtain the most efficient algorithm, able to build cages of more than a hundred atoms.
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity of Finding and Enumerating Interconnection Trees
Decision problem for minimum interconnection trees in multipartite graphs is NP-complete but FPT in number of parts and polynomial-time on complete, quasi-complete, and t-quasi-complete graphs.