Randomly Sampling Molecules

DOI10.1137/S0097539797318864MaRDI QIDQ4943848zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Leslie Ann Goldberg, Mark 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

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

Recommendations

• The random selection of unlabeled graphs
• Random models and analyses for chemical graphs
• A linear-time algorithm for sampling graphs with given degrees
• A sequential algorithm for generating random graphs
• scientific article; zbMATH DE number 6863607

Cited in

(1)

• Random models and analyses for chemical graphs

This page was built for publication: Randomly Sampling Molecules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943848)