Items related to Efficient Algorithms for Listing Combinatorial Structures...

Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science, Series Number 5) - Softcover

 
9780521117883: Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science, Series Number 5)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Book Description

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 computer scientists and combinatorialists?

Review

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

"About this title" may belong to another edition of this title.

Other Popular Editions of the Same Title

9780521450218: Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science, Series Number 5)

Featured Edition

ISBN 10:  0521450217 ISBN 13:  9780521450218
Publisher: Cambridge University Press, 1993
Hardcover

Search results for Efficient Algorithms for Listing Combinatorial Structures...

Stock Image

LESLIE GOLDBERG
Published by Cambridge University Press, 2009
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Softcover

Seller: Basi6 International, Irving, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-101104

Contact seller

Buy New

US$ 39.69
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Goldberg, Leslie Ann
Published by Cambridge University Press, 2009
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Feb2215580243829

Contact seller

Buy New

US$ 51.13
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Leslie Ann Goldberg
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Paperback

Seller: Grand Eagle Retail, Mason, OH, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback. Condition: new. Paperback. 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 computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. Some related work is also included, which 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. First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Some related work is also included which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521117883

Contact seller

Buy New

US$ 63.71
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Goldberg, Leslie Ann
Published by Cambridge Univ Pr, 2009
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Paperback
Print on Demand

Seller: Revaluation Books, Exeter, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback. Condition: Brand New. 1st edition. 176 pages. 9.53x6.69x0.55 inches. In Stock. This item is printed on demand. Seller Inventory # __0521117887

Contact seller

Buy New

US$ 56.90
Convert currency
Shipping: US$ 13.36
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Leslie Ann Goldberg Goldberg Leslie Ann
Published by Cambridge University Press CUP, 2009
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Softcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. pp. 180. Seller Inventory # 26535548

Contact seller

Buy New

US$ 67.98
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Leslie Ann Goldberg
Published by Cambridge University Press, 2009
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Paperback / softback
Print on Demand

Seller: THE SAINT BOOKSTORE, Southport, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 330. Seller Inventory # C9780521117883

Contact seller

Buy New

US$ 60.14
Convert currency
Shipping: US$ 13.42
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Goldberg, Leslie Ann
Published by Cambridge University Press, 2009
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Softcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9780521117883_new

Contact seller

Buy New

US$ 59.92
Convert currency
Shipping: US$ 16.00
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Leslie Goldberg
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Paperback

Seller: Chiron Media, Wallingford, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521117883

Contact seller

Buy New

US$ 55.63
Convert currency
Shipping: US$ 20.69
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 10 available

Add to basket

Stock Image

Goldberg Leslie Ann Leslie Ann Goldberg
Published by Cambridge University Press, 2009
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Softcover
Print on Demand

Seller: Majestic Books, Hounslow, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Print on Demand pp. 180 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. Seller Inventory # 8360995

Contact seller

Buy New

US$ 69.83
Convert currency
Shipping: US$ 8.68
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Goldberg Leslie Ann Leslie Ann Goldberg
Published by Cambridge University Press, 2009
ISBN 10: 0521117887 ISBN 13: 9780521117883
New Softcover
Print on Demand

Seller: Biblios, Frankfurt am main, HESSE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. PRINT ON DEMAND pp. 180. Seller Inventory # 18535542

Contact seller

Buy New

US$ 76.22
Convert currency
Shipping: US$ 11.60
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

There are 4 more copies of this book

View all search results for this book