Contact
How to shop
Delivery
Shopping guide
Efficient Algorithms for Listing Combinatorial Structures
English
131 b
30-day return policy
Customers also purchased
/
binding.
34.95
€
/
Paperback
16.16
€
/
Paperback
16.16
€
/
Paperback
44.45
€
/
Paperback
30.20
€
/
Paperback
23.74
€
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
75.98
€
/
Paperback
23.84
€
/
Paperback
10.30
€
/
Hardback
98.62
€
/
Hardback
227.56
€