Free delivery for orders over 69.99 euro

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

Free delivery for purchases over 69.99 €

DPD courier 4.49 € DPD point 3.99 € GLS courier 5.49 € GLS point 4.49 € Croatian Post 5.49 € Overseas courier 5.49 € Box Now 4.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Free delivery for orders over 69.99 euro

Efficient Algorithms for Listing Combinatorial Structures

Name: Efficient Algorithms for Listing Combinatorial Structures
Brand: Cambridge University Press
SKU: 02031294
Price: 150.23 EUR
Availability: InStock
Author: Leslie Ann Goldberg
ISBN: 9780521450218

Leslie Ann Goldberg

Language

English

Book Hardback

Libristo code: 02031294

Publishers Cambridge University Press, April 1993

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

Libristo code: 02031294

366 b

150.23 €

In stock at our supplier Shipping in 9-13 days

Up to 30 days for returns

Customers also purchased

Verschwender Ferdinand Raimund

Paperback

11.64 €

Gulag a Československo Válka Adam Hradilek

Hardback

23.79 €

Un juego peligroso. Kiss me like you love me 2 Shell

MP3

13.45 €

FACULTATIVO ESPECIALISTA MEDICO/A OSAKIDETZA-SERVICIO VAS 7 EDITORES

Paperback

20.48 €

Případ pro veverku v kole Slávka Poberová

Paperback

4.01 €

100 massage et activités de relaxation avec mon bébé Gilles Diedrichs

Paperback

15.16 €

Staudingers Kommentar BGB §§ 1638-1683 (Vermögenssorge, Kindesschutz, Sorgerechtswechsel) Michael Coester

Hardback

212.30 €

Einkaufen und Freizeit - Synergie- und Kopplungseffekte zwischen neuen Einkaufszentren und ihrem Umfeld Markus Wotruba

Paperback

65.47 €

HISTORIA DEL CINE JOSE LUIS SANCHEZ NORIEGA

Hardback

35.34 €

EL MALEFICIO DE LA PRINCESA ANTONIO A. GOMEZ YEBRA

Paperback

15.66 €

Vom PCI zum PDS - Die Sozialdemokratisierung der italienischen kommunistischen Partei Petra Buß

Paperback

16.06 €

Ernährungsratgeber Morbus Crohn und Colitis ulcerosa Sven-David Müller

Paperback

15.16 €

Essai Sur Le Vocalisme Du Sogdien. These Complementaire Pour Le Doctorat Es Lettres Presentee Gauthiot-R

Paperback

15.96 €

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.