The following text field will produce suggestions that follow it as you type.

Barnes and Noble

Efficient Algorithms for Listing Combinatorial Structures

Current price: $46.99
Efficient Algorithms for Listing Combinatorial Structures
Efficient Algorithms for Listing Combinatorial Structures

Barnes and Noble

Efficient Algorithms for Listing Combinatorial Structures

Current price: $46.99

Size: OS

Loading Inventory...
CartBuy Online
*Product information may vary - to confirm product availability, pricing, shipping and return information please contact Barnes and Noble
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.

More About Barnes and Noble at The Summit

With an excellent depth of book selection, competitive discounting of bestsellers, and comfortable settings, Barnes & Noble is an excellent place to browse for your next book.

Powered by Adeptmind