UNSPECIFIED (1997) Randomly sampling molecules. In: 8th Annual ACM/SIAM Symposium on Discrete Algorithms, NEW ORLEANS, LA, JAN 05-07, 1997. Published in: PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS pp. 183-192.

Full text not available from this repository.

Abstract

We give the first 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 the first 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:	PROCEEDINGS OF THE EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
Publisher:	SIAM
ISBN:	0-89871-390-0
Date:	1997
Number of Pages:	10
Page Range:	pp. 183-192
Publication Status:	Published
Title of Event:	8th Annual ACM/SIAM Symposium on Discrete Algorithms
Location of Event:	NEW ORLEANS, LA
Date(s) of Event:	JAN 05-07, 1997
URI:	http://wrap.warwick.ac.uk/id/eprint/17609

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item