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

£101.69

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

Name: Efficient Algorithms for Listing Combinatorial Structures: 5 (Distinguished Dissertations in Computer Science, Series Number 5)
Brand: Cambridge University Press
Price: 101.69 GBP
Availability: InStock

Software Design, Testing & Engineering

This is the most expensive it has ever been. Walk away.

£102 today · previous high £102 · all-time low £100

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 84 days · 84 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 84 days • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £101 (67 days, 79.8%)

Price range: £100 - £101

Price levels: 2 different prices over 84 days

Description

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

Product Specifications

Brand: Cambridge University Press
Format: hardcover
ASIN: 0521450217
Category: Books > Subjects > Computing & Internet > Programming > Software Design, Testing & Engineering
Domain: Amazon UK
Release Date: 22 April 1993
Listed Since: 22 December 2006

Barcode

No barcode data available

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

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Combinatorial Methods with Computer Applications: Discrete Mathematics and Its Applications

Surveys in Combinatorics 2024: Series Number 493 (London Mathematical Society Lecture Note Series, Series Number 493)

LMS: 241 Surveys Combinatorics, 97 (London Mathematical Society Lecture Note Series, Series Number 241)

HANDBOOK OF COMBINATORICS VOLUME 1: v. 1

Combinatorial Problems and Exercises (AMS Chelsea Publishing) (Chelsea Publications)

Surveys in Combinatorics 2009: 365 (London Mathematical Society Lecture Note Series, Series Number 365)

50 years of Combinatorics, Graph Theory, and Computing (Discrete Mathematics and Its Applications)

Surveys in Combinatorics 2019: 456 (London Mathematical Society Lecture Note Series, Series Number 456)

Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings: 13270 (Lecture Notes in Computer Science, 13270)

Combinatorial Algorithms: Generation, Enumeration, and Search: 7 (Discrete Mathematics and Its Applications)

Combinatorics: A Guided Tour (AMS/MAA Textbooks)

Combinatorics with Emphasis on the Theory of Graphs: 54 (Graduate Texts in Mathematics, 54)

Combinatorics: A Guided Tour (AMS/MAA Textbooks)

Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)

CRC Press Combinatorial Scientific Computing: 12 - CRC Press

Combinatorial Geometry and Its Algorithmic Applications: The Alcala Lectures (Mathematical Surveys and Monographs)

Combinatorial Problems and Exercises

Combinatorics '86: Proceedings of the International Conference on Incidence Geometries and Combinatorial Structures Passo Della Mendola, Trento, Italy, 30 June-5 July, 1986

New Perspectives in Algebraic Combinatorics: 38 (Mathematical Sciences Research Institute Publications, Series Number 38)

Surveys in Combinatorics 2021 (London Mathematical Society Lecture Note Series)

Wiley Combinatorics: 63 (Wiley Series in Discrete Mathematics)

COMBINATORICS: ANCIENT & MODERN PAPER: Ancient & Modern

Surveys in Combinatorics 2005: 327 (London Mathematical Society Lecture Note Series, Series Number 327)

Combinatorics: Ancient & Modern