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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

N� de r�f. du vendeur 9780521117883

Contacter le vendeur

Signaler cet article

D�tails bibliographiques

Titre: Efficient Algorithms for Listing Combinatorial Structures (Paperback)
�diteur: Cambridge University Press, Cambridge
Date de parution: 2009
Langue: anglais
ISBN � 10 chiffres: 0521117887
ISBN � 13 chiffres: 9780521117883
Reliure: Paperback
�tat de l'article: new

A propos de ce titre

Synopsis

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures.

Revue de presse

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

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

Description de la librairie

Visitez la page d�accueil du vendeur

Informations commerciales relatives au vendeur

The Nile Group Pty Ltd
42 Apex Drive, Truganina, VIC, 3029, Australia

Conditions de vente et de livraison

Conditions g�n�rales de vente

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Conditions d'exp�dition

Please note that titles are dispatched from our UK and NZ warehouse. Delivery times specified in shipping terms. Orders ship within 2 business days. Delivery to your door then takes 8-15 days.