Efficient Algorithms for Listing Combinatorial Structures by Leslie Ann Goldberg
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 that are of interest to theoretical computer scientists and combinatorialists? Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colorable graphs. Some related work is also included that compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. In particular, the difficulty of evaluating Polya's cycle polynomial is demonstrated.-
Logic Programming
-
Three-Dimensional Integrated Circuit Layout
-
Specification and Proof in Real Time CSP
-
A Modular and Extensible Network Storage Architecture
-
Affine Analysis of Image Sequences
-
Functional Programming and Input/Output
-
Modelling Auditory Processing and Organisation
-
Axiomatic Domain Theory in Categories of Partial Maps
-
Qualified Types
-
The Map-Building and Exploration Strategies of a Simple Sonar-Equipped Mobile Robot
-
A Compositional Approach to Performance Modelling
"..selected as one of the three best theses in computer science in the UK in 1992....makes an important contribution to the complexity theory of listing and counting combinatorial structures....gives new and interesting results..." Mathematical Reviews
"By any standard, this is an exceptional dissertation. It is well written, with the author always explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture. The author has built up a substantial theory...." G.F. Royle, Computing Reviews
"...an impressive and thorough examination of listing problems in this framework...the complicated probabilistic arguments needed for the analysis are handled well...this is an exceptional dissertation...well-written, with the author always carefully explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture." G.F. Royle, Mathematics of Computing
"By any standard, this is an exceptional dissertation. It is well written, with the author always explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture. The author has built up a substantial theory...." G.F. Royle, Computing Reviews
"...an impressive and thorough examination of listing problems in this framework...the complicated probabilistic arguments needed for the analysis are handled well...this is an exceptional dissertation...well-written, with the author always carefully explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture." G.F. Royle, Mathematics of Computing
| SKU | Unavailable |
| ISBN 13 | 9780521117883 |
| ISBN 10 | 0521117887 |
| Title | Efficient Algorithms for Listing Combinatorial Structures |
| Author | Leslie Ann Goldberg |
| Series | Distinguished Dissertations In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Cambridge University Press |
| Year published | 2009-07-30 |
| Number of pages | 180 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |