Cargando…
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank
Cycle rank is an important notion that is widely used to classify, understand, and discover new chemical compounds. We propose a method to enumerate all non-isomorphic tree-like graphs of a given cycle rank with self-loops and no multiple edges. To achieve this, we develop an algorithm to enumerate...
Autores principales: | Azam, Naveed Ahmed, Shurbevski, Aleksandar, Nagamochi, Hiroshi |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7711681/ https://www.ncbi.nlm.nih.gov/pubmed/33287063 http://dx.doi.org/10.3390/e22111295 |
Ejemplares similares
-
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops
por: Azam, Naveed Ahmed, et al.
Publicado: (2020) -
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies
por: Shimizu, Masaaki, et al.
Publicado: (2011) -
Efficient enumeration of monocyclic chemical graphs with given path frequencies
por: Suzuki, Masaki, et al.
Publicado: (2014) -
Comparison and Enumeration of Chemical Graphs
por: Akutsu, Tatsuya, et al.
Publicado: (2013) -
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming
por: Azam, Naveed Ahmed, et al.
Publicado: (2021)