The counting of rectangular dissections
In this paper results are presented from two independently developed computer programs -- algorithms RK and CB -- on counting and classifying rectangular dissections. A population census is given for all weights less than eleven. In spite of the radically different approaches adopted by the two algorithms in solving this enumeration problem, both sets of results agree completely.
Year of publication: |
1978
|
---|---|
Authors: | Bloch, C J ; Krishnamurti, R |
Published in: |
Environment and Planning B: Planning and Design. - Pion Ltd, London, ISSN 1472-3417. - Vol. 5.1978, 2, p. 207-214
|
Publisher: |
Pion Ltd, London |
Saved in:
Saved in favorites
Similar items by person
-
On the set and number of minimal gratings for rectangular dissections
Bloch, C J, (1976)
-
Catalogue of small rectangular plans
Bloch, C J, (1979)
-
Krishnamurti, R, (1980)
- More ...