Efficient Algorithms for Listing Combinatorial Structures

Name: Efficient Algorithms for Listing Combinatorial Structures
Brand: Cambridge University Press
SKU: 9780521117883
Price: 288.17 RON
Availability: InStock

Autor: Leslie Ann Goldberg

Limbă:

Legare: Carte broșată

Editura: Cambridge University Press

Disponibilitate: În depozitul extern

Expediem în 9-15 zile

288.17 lei

First published in 1993, this thesis is concerned with the design of efficient algorithms for listin...

Informații despre carte

Autor

Leslie Ann Goldberg

Limbă

engleză

Legare

Carte - Carte broșată

Publicat

2009

Pagini

180

EAN

9780521117883

ISBN

0521117887

Enbook ID

02022652

Editura

Cambridge University Press

Greutate

300

Dimensiuni

170 x 244 x 10

Descriere completă

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.

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Cele mai căutate

Categories

Authors

Publishers

Produse

Produse

Efficient Algorithms for Listing Combinatorial Structures

Informații despre carte

Descriere completă

S-ar putea să te intereseze

Clienții care au cumpărat această carte au mai cumpărat și