• Home >
  • Buy >
  • Nonfiction >

  • Efficient Algorithms for Listing Combinatorial Structures by Leslie Ann Goldberg (1993, Hardcover)

Efficient Algorithms for Listing Combinatorial Structures by Leslie Ann Goldberg (1993, Hardcover) 
Efficient Algorithms for Listing Combinatorial Structures by Leslie Ann Goldberg (1993, Hardcover)

 
Efficient Algorithms for Listing Combinatorial Structures by Leslie Ann Goldberg (1993, Hardcover)

Publisher: Cambridge Univ Pr
Publication Date: 1993-07-01
Series: Distinguished Dissertations in Computer Science, No 5
Language: English
Format: Hardcover
ISBN-10: 0521450217
ISBN-13: 9780521450218
Product ID: EPID226603
Save this productSell oneWrite a review
Portions of this page Copyright 1995 - 2010 Muze Inc. All rights reserved.
Refine search
Preferences
Distance
Please enter valid zipcode.
Please select a valid popular city.
Please enter valid zipcode or select a valid popular city.
Within miles of ZIP
6 results|Group by condition
Details
Publication Date:1993-07-01
Series:Distinguished Dissertations in Computer Science, No 5

Size
Length:160 pages
Height:10.3 in
Width:7.3 in
Thickness:0.5 in
Weight:17.6 oz

Publisher's Note
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 P-lya's cycle polynomial is demonstrated.

See an error? Submit a change request

    About eBay | Announcements | Security Center | Resolution Center | eBay Toolbar | Policies | Government Relations | Site Map | Help
    Copyright © 1995-2009 eBay Inc. All Rights Reserved. Designated trademarks and brands are the property of their respective owners. Use of this Web site constitutes acceptance of the eBay User Agreement and Privacy Policy.
    eBay official time

    Error
    We're sorry, but there's been an error.
    Please try again.