Efficient Generation of Stable Planar Cages for Chemistry-Reference-Cited by-同舟云学术

Efficient Generation of Stable Planar Cages for Chemistry

Published:2015 Issue: Volume: Page:235-246
ISSN:0302-9743
Container-title:Experimental Algorithms
language:
Short-container-title:

Author:

Barth Dominique,David Olivier,Quessette Franck,Reinhard Vincent,Strozecki Yann,Vial Sandrine

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-20086-6_18

Reference17 articles.

1. Holst, J., Trewin, A., Cooper, A.: Porous organic molecules. Nature Chem. 2, 915–920 (2010)

2. Strozecki, Y.: Enumeration complexity and matroid decomposition. Ph.D thesis, Université Paris Diderot - Paris 7 (2010)

3. Li, G., Ruskey, F.: The advantages of forward thinking in generating rooted and free trees. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 939–940 (1999)

4. Liskovets, V.: Enumeration of nonisomorphic planar maps. Selecta Math. Soviet. 4, 304–323 (1985)

5. Cori, R., Vauquelin, B.: Planar maps are labelled trees. Canadian Journal Math. 33, 1023–1042 (1981)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithmic Graph Theory, Reinforcement Learning and Game Theory in MD Simulations: From 3D Structures to Topological 2D-Molecular Graphs (2D-MolGraphs) and Vice Versa;Molecules;2023-03-23

2. Algorithmic graph theory for post-processing molecular dynamics trajectories;Molecular Physics;2023-01-19

3. Enumerating models of DNF faster: Breaking the dependency on the formula size;Discrete Applied Mathematics;2021-11

4. Incremental delay enumeration: Space and time;Discrete Applied Mathematics;2019-09

5. Topological landscapes of porous organic cages;Nanoscale;2017