Randomly Sampling Molecules

DOI10.1137/S0097539797318864zbMath0958.68138DBLPjournals/siamcomp/GoldbergJ99OpenAlexW2102234325WikidataQ29387470 ScholiaQ29387470MaRDI QIDQ4943848

Leslie Ann Goldberg, Mark R. Jerrum

Publication date: 19 March 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539797318864

zbMATH Keywords

polynomial time algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Random graphs (graph-theoretic aspects) (05C80) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex degrees (05C07)

Related Items (1)

Random Models and Analyses for Chemical Graphs

This page was built for publication: Randomly Sampling Molecules