Efficient Algorithms for Listing Combinatorial Structures (Hardcover)

Leslie Ann Goldberg

ISBN 10: 0521450217 / ISBN 13: 9780521450218

Published by Cambridge University Press, Cambridge, 1993

About this Item

Hardcover. 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. This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9780521450218

Bibliographic Details

• Title: Efficient Algorithms for Listing Combinatorial Structures (Hardcover)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 1993
• Language: English
• ISBN 10: 0521450217
• ISBN 13: 9780521450218
• Binding: Hardcover
• Condition: new

About this title

Synopsis

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 that are of interest to theoretical computer scientists and combinatorialists? Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colorable graphs. Some related work is also included that 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.

Book Description

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?