Abstract
In this paper we describe an algorithm which generates all colored planar maps with a good minimum sparsity from simple motifs and rules to connect them. An implementation of this algorithm is available and is used by chemists who want to quickly generate all sound molecules they can obtain by mixing some basic components.
Cite
CITATION STYLE
Barth, D., David, O., Quessette, F., Reinhard, V., Strozecki, Y., & Vial, S. (2015). Efficient generation of stable planar cages for chemistry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9125, pp. 235–246). Springer Verlag. https://doi.org/10.1007/978-3-319-20086-6_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
