Contact
How to shop
Delivery
Shopping guide
Efficient Algorithms for Listing Combinatorial Structures
English
140 b
30-day return policy
Customers also purchased
/
binding.
12 428
Ft
/
Paperback
6 272
Ft
/
Paperback
6 272
Ft
/
Paperback
17 267
Ft
/
Paperback
11 504
Ft
/
Paperback
8 412
Ft
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
26 969
Ft
/
Paperback
9 147
Ft
/
Paperback
3 942
Ft
/
Hardback
35 001
Ft
/
Hardback
8 444
Ft
/
Hardback
80 772
Ft
Hi! I'm Libroamiko, your book advisor.
How can I help you?