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

£99.79

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: 60.86 GBP
Availability: InStock

Software Design, Testing & Engineering

Price History & Forecast

Last 91 days • 91 data points

Historical

Generating forecast...

Price Distribution

Price distribution over 91 days • 10 price levels

Days at Price

Current Price

Price Analysis

Most common price: £59 (20 days, 22.0%)

Price range: £54 - £103

Price levels: 10 different prices over 91 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)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

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

Combinatorics: A Guided Tour (AMS/MAA Textbooks)

A Course in Topological Combinatorics (Universitext)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Coloring Mixed Hypergraphs: Theory, Algorithms and Applications (Fields Institute Monographs)

LMS: 52 Combinatorics (London Mathematical Society Lecture Note Series, Series Number 52)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Combinatorial Programming: Methods and Applications: Proceedings of the NATO Advanced Study Institute held at the Palais des Congrès, Versailles, ... 1974: 19 (Nato Science Series C:, 19)

Combinatorial Matrix Theory: 39 (Encyclopedia of Mathematics and its Applications, Series Number 39)

Global Methods for Combinatorial Isoperimetric Problems: 90 (Cambridge Studies in Advanced Mathematics, Series Number 90)

Combinatorics and Probability: Celebrating Bela Bollobas's 60th Birthday

Strongly Regular Graphs: 182 (Encyclopedia of Mathematics and its Applications, Series Number 182)

Treewidth, Kernels, and Algorithms: Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday: 12160 (Lecture Notes in Computer Science, 12160)

A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)

Applied Combinatorics on Words: 105 (Encyclopedia of Mathematics and its Applications, Series Number 105)

LMS: 187 Surveys Combinatorics 1993 (London Mathematical Society Lecture Note Series, Series Number 187)

Graphs & Digraphs (Textbooks in Mathematics)

Combinatorics: The Rota Way (Cambridge Mathematical Library)

Combinatorics of Finite Geometries

Enumerative Combinatorics: Volume 1: 49 (Cambridge Studies in Advanced Mathematics, Series Number 49)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Graph-Theoretic Concepts in Computer Science: 23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings: 1335 (Lecture Notes in Computer Science, 1335)