Randomly sampling molecules
UNSPECIFIED (2000) Randomly sampling molecules. In: 8th Annual ACM/SIAM Symposium on Discrete Algorithms, NEW ORLEANS, LOUISIANA, JAN 05-07, 1997. Published in: SIAM JOURNAL ON COMPUTING, 29 (3). pp. 834-853.Full text not available from this repository.
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an unlabelled connected multigraph with the given degree sequence. We also give a polynomial-time algorithm for the following related problem: Given a molecular formula, select, uniformly at random, a structural isomer having the given formula.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Q Science > QA Mathematics
|Journal or Publication Title:||SIAM JOURNAL ON COMPUTING|
|Date:||12 January 2000|
|Number of Pages:||20|
|Page Range:||pp. 834-853|
|Title of Event:||8th Annual ACM/SIAM Symposium on Discrete Algorithms|
|Location of Event:||NEW ORLEANS, LOUISIANA|
|Date(s) of Event:||JAN 05-07, 1997|
Actions (login required)