Cargando…
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops
Graph enumeration with given constraints is an interesting problem considered to be one of the fundamental problems in graph theory, with many applications in natural sciences and engineering such as bio-informatics and computational chemistry. For any two integers [Formula: see text] and [Formula:...
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/PMC7597174/ https://www.ncbi.nlm.nih.gov/pubmed/33286692 http://dx.doi.org/10.3390/e22090923 |
Ejemplares similares
-
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank
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) -
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) -
Algorithmic aspects of graph connectivity
por: Nagamochi, Hiroshi, et al.
Publicado: (2008)