Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
Efficient Algorithms for Listing Combinatorial Structures

Efficient Algorithms for Listing Combinatorial Structures

$129.00 (C)

Part of Distinguished Dissertations in Computer Science

  • Date Published: June 1993
  • availability: Available
  • format: Hardback
  • isbn: 9780521450218

$ 129.00 (C)
Hardback

Add to cart Add to wishlist

Other available formats:
Paperback, eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Winner of distinguished dissertation award
    • Contains material of interest to combinatorialists as well as computer scientists
    Read more

    Reviews & endorsements

    "...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

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: June 1993
    • format: Hardback
    • isbn: 9780521450218
    • length: 178 pages
    • dimensions: 244 x 170 x 11 mm
    • weight: 0.49kg
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Techniques for listing combinatorial structures
    3. Applications to particular families of structures
    4. Directions for future work on listing
    5. Related results
    6. Bibliography.

  • Author

    Leslie Ann Goldberg, Sandia National Laboratories, Peru

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×