You might also like

More about Efficient Algorithms for Listing Combinatorial Structures

• Book details
• Synopsis
• Trending among others

You get 375 loyalty points

Book synopsis

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.

Book details

Book category Books in English Mathematics & science Mathematics Combinatorics & graph theory

• Full title: Efficient Algorithms for Listing Combinatorial Structures
• Author: Leslie Ann Goldberg
• Language: English
• Binding: Hardback
• Number of pages: 178
• EAN: 9780521450218
• ISBN: 0521450217
• ID: 02031294
• Publisher: Cambridge University Press
• Weight: 49 g
• Dimensions: 244 × 170 × 11 mm
• Date of publishing: 22. April 1993

Trending among others

---

---

---