0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Buy Now

Efficient Algorithms for Listing Combinatorial Structures (Hardcover) Loot Price: R2,989
Discovery Miles 29 890
You Save: R354 (11%)
Efficient Algorithms for Listing Combinatorial Structures (Hardcover): Leslie Ann Goldberg

Efficient Algorithms for Listing Combinatorial Structures (Hardcover)

Leslie Ann Goldberg

Series: Distinguished Dissertations in Computer Science

 (sign in to rate)
Was R3,343 Loot Price R2,989 Discovery Miles 29 890 | Repayment Terms: R280 pm x 12* You Save R354 (11%)

Bookmark and Share

Expected to ship within 12 - 17 working days

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.

General

Imprint: Cambridge UniversityPress
Country of origin: United Kingdom
Series: Distinguished Dissertations in Computer Science
Release date: April 1993
First published: 1993
Authors: Leslie Ann Goldberg
Dimensions: 244 x 170 x 11mm (L x W x T)
Format: Hardcover
Pages: 178
ISBN-13: 978-0-521-45021-8
Categories: Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
Books > Computing & IT > Computer programming > General
Promotions
LSN: 0-521-45021-7
Barcode: 9780521450218

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

You might also like..

Problem Solving with C++ - Global…
Walter Savitch Paperback R2,632 Discovery Miles 26 320
Introducing Delphi Programming - Theory…
John Barrow, Linda Miller, … Paperback  (1)
R863 Discovery Miles 8 630
C++ Programming - Program Design…
D. Malik Paperback R1,728 R1,596 Discovery Miles 15 960
Program Construction - Calculating…
Roland Backhouse Paperback R2,800 Discovery Miles 28 000
Programming Logic & Design…
Joyce Farrell Paperback R1,304 R1,212 Discovery Miles 12 120
Sams Teach Yourself: Beginning…
Greg Perry, Dean Miller Paperback R619 Discovery Miles 6 190
C++ How to Program: Horizon Edition
Harvey Deitel, Paul Deitel Paperback R1,954 Discovery Miles 19 540
Java How to Program, Late Objects…
Paul Deitel, Harvey Deitel Paperback R900 R750 Discovery Miles 7 500
Data Abstraction and Problem Solving…
Janet Prichard, Frank Carrano Paperback R2,373 Discovery Miles 23 730
The Data Quality Blueprint - A Practical…
John Parkinson Hardcover R1,736 Discovery Miles 17 360
Using UML - Software Engineering with…
Perdita Stevens Paperback R2,384 Discovery Miles 23 840
Object-Oriented Game Development
Julian Gold Paperback R2,292 R1,812 Discovery Miles 18 120

See more

Partners