Efficient Algorithms for Listing Combinatorial Structures [Goldberg 1993-06-25].pdf

(4280 KB) Pobierz
EFFICIENT ALGORITHMS
FOR LISTING COMBINATORIAL STRUCTURES
Distinguished Dissertations in Computer Science
Edited by
CJ. van Rijsbergen, University of Glasgow
The Conference of Professors of Computer Science (CPCS) in conjunction
with the British Computer Society (BCS), selects annually for publication up
to four of the best British Ph.D. dissertations in computer science. The scheme
began in 1990. Its aim is to make more visible the significant contribution
made by Britain - in particular by students - to computer science, and to
provide a model for future students. Dissertations are selected on behalf of
CPCS by a panel whose members are:
M. Clint, Queen's University, Belfast
RJ.M. Hughes, University of Glasgow
R. Milner, University of Edinburgh (Chairman)
K. Moody, University of Cambridge
M.S. Paterson, University of Warwick
S. Shrivastava, University of Newcastle upon Tyne
A. Sloman, University of Birmingham
F. Sumner, University of Manchester
EFFICIENT ALGORITHMS FOR LISTING
COMBINATORIAL STRUCTURES
Leslie Ann Goldberg
Sandia National Laboratories
CAMBRIDGE
UNIVERSITY PRESS
CAMBRIDGE UNIVERSITY PRESS
Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, Sao Paulo, Delhi
Cambridge University Press
The Edinburgh Building, Cambridge CB2 8RU, UK
Published in the United States of America by Cambridge University Press, New York
www. Cambridge. org
Information on this title: www.cambridge.org/9780521117883
© Cambridge University Press 1993
This publication is in copyright. Subject to statutory exception
and to the provisions of relevant collective licensing agreements,
no reproduction of any part may take place without the written
permission of Cambridge University Press.
First published 1993
This digitally printed version 2009
A catalogue record for this publication is available from the British Library
ISBN 978-0-521-45021-8 hardback
ISBN 978-0-521-11788-3 paperback
Zgłoś jeśli naruszono regulamin