Chemical trees enumeration algorithms
From MaRDI portal
Recommendations
- On the Sombor index of chemical trees
- Randić ordering of chemical trees
- Chemical trees with extremal Mostar index
- Tree enumeration and tree algorithm complexity computation
- Chemical trees minimizing energy and Hosoya index
- Pruning the search tree in the constructive enumeration of molecular graphs
- scientific article; zbMATH DE number 7723580
- Chemical Trees with Maximal VDB Topological Indices
- The Estrada index of chemical trees
- A note on chemical trees with maximal inverse sum indeg index
Cited in
(12)- Counting glycans revisited
- Randić ordering of chemical trees
- Generation, ranking and unranking of ordered trees with degree bounds
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- Pruning the search tree in the constructive enumeration of molecular graphs
- An old graph theoretical\,-\,chemical problem that has now been solved: The enumeration of alkane isomers.
- Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
- Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming
- A branch-price-and-cut algorithm for the minimum evolution problem
- scientific article; zbMATH DE number 1910961 (Why is no real title available?)
- An efficient algorithm for the generation of planar polycyclic hydrocarbons with a given boundary
- Unranking of small combinations from large sets
This page was built for publication: Chemical trees enumeration algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1429293)
