Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.49 € DPD courier 3.99 € DPD point 2.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Efficient Algorithms for Listing Combinatorial Structures

Name: Efficient Algorithms for Listing Combinatorial Structures
Brand: Cambridge University Press
SKU: 02022652
Price: 55.89 EUR
Availability: InStock
Author: Leslie Ann Goldberg
ISBN: 9780521117883

Leslie Ann Goldberg

Language

English

Book Paperback

Libristo code: 02022652

Publishers Cambridge University Press, July 2009

First published in 1993, this thesis is concerned with the design of efficient algorithms for listin... Full description

Libristo code: 02022652

137 b

55.89 € VAT included

In stock at our supplier Shipping in 9-15 days

Delivery to Austria

30-day return policy

Customers also purchased

Critical Role: The Mighty Nein Origins: Yasha Ashley Johnson

Hardback

16.00 €

Auxiliares de servicios generales. Ministerio de defensa. Programa 1 (ayudantes de cocina) temario, Editorial Mad

binding.

35.99 €

Efficient Consumer Response - Komponenten, Kooperationsfelder und moegliche Probleme J.C. Scheffold

Paperback

17.95 €

Auf den Spuren des Inn-Chiemsee-Gletschers, Übersicht Robert Darga

Paperback

20.00 €

Lissabon. Lisboa. Lisbon

Map

10.19 €

Les Douleurs fantômes Mélissa Da Costa

Paperback

11.49 €

Die Erzählanalyse JAKOB Marc Luder

Paperback

15.00 €

Salons de T.Thore W. burger

Paperback

31.79 €

Schleswig-Holstein Peter Schuster

Hardback

14.95 €

Una industria que vive de la muerte Benito Perez Galdos

Adobe ePub DRM

6.19 €

Aufwachsen zwischen Traditions- und Zukunftsorientierung Matthias D. Witte

Paperback

55.29 €

Weltgesellschaft in Bewegung Christoph Virgl

Paperback

52.95 €

The Promised Neverland T02

Paperback

11.09 €

Indice Para La Sociedad Actual Hugo A E Fritzler

Paperback

26.29 €

Formation Certification MCSD Examen 70-483 (tome 1) Patrice Rey

Paperback

37.29 €

Unterstützung der Elternarbeit durch tiergestützte Intervention in der stationären Unterbringung Christian Haas

Paperback

17.95 €

Čo vietor spieva Alexander Blok

Hardback

7.29 €

Les investissements directs étrangers (IDE) et l'économie camerounaise Ivan Mélachéo

Paperback

46.59 €

Krankheiten peripherer Nerven Reinhard Kiefer

Paperback

52.39 €

Apercu Historique Sur Les Ferments Et Fermentations Normales Et Morbides Roussy-B

Paperback

31.29 €

Guardini, R., obras Selectas. Tomo II- El Padrenuestro - Los salmos - Oraciones para iniciar el día

Hardback

21.39 €

El cristal sanador : recetas a base de cristales que cambiarán tu vida Philip Permutt

Paperback

24.59 €

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.