General

Efficient Algorithms for Listing Combinatorial Structures

Name: Efficient Algorithms for Listing Combinatorial Structures
Brand: Cambridge University Press
SKU: 9780521450218
Price: 14631.00 INR
Availability: InStock
ISBN: 9780521450218

EFFICIENT ALGORITHMS FOR LISTI

Contributor(s): Goldberg, Leslie Ann Author Format: Hardback

Hardback · ISBN 9780521450218

₹14,631 2%

₹14,964

Inclusive of GST and other taxes

100% Quality Assurance

No Account Creation Required

Fast Delivery

Secured Transactions

Arriving at your doorstep in 10-15 days

Our logisitcs team will make sure everyitem is delivered safely

Key Specifications

ISBN	9780521450218
Subtitle	EFFICIENT ALGORITHMS FOR LISTI
Publisher	Cambridge University Press
Publication date	April 1993
Language	English
MRP	£116.00 GBP
Page count	178
Item weight	108 g

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.

Efficient Algorithms for Listing Combinatorial Structures

Key Specifications

Goldberg, Leslie Ann Author

Related titles