Efficient Algorithms for Listing Combinatorial Structures (Paperback)

Leslie Ann Goldberg

ISBN 10: 0521117887 / ISBN 13: 9780521117883

Verlag: Cambridge University Press, Cambridge, 2009

Beschreibung

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.

Bestandsnummer des Verkäufers 9780521117883

Bibliografische Details

• Titel: Efficient Algorithms for Listing Combinatorial Structures (Paperback)
• Verlag: Cambridge University Press, Cambridge
• Erscheinungsjahr: 2009
• Sprache: Englisch
• ISBN-10: 0521117887
• ISBN-13: 9780521117883
• Einband: Paperback
• Zustand: new

Über diesen Titel

Inhaltsangabe

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

Über die Autorin bzw. den Autor

Charlotte y Peter Fiell son dos autoridades en historia, teoría y crítica del diseño y han escrito más de sesenta libros sobre la materia, muchos de los cuales se han convertido en éxitos de ventas. También han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Diseño del siglo XX, El diseño industrial de la A a la Z, Scandinavian Design y Diseño del siglo XXI.