Efficient Algorithms for Listing Combinatorial Structures

by Leslie Ann Goldberg

Book Overview

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical...

• Format: Paperback
• Language: English
• ISBN: 0521117887
• ISBN13: 9780521117883
• Release Date: July 2009
• Publisher: Cambridge University Press
• Length: 180 Pages
• Weight: 0.65 lbs.
• Dimensions: 0.4" x 6.7" x 9.6"