Książka Efficient Algorithms for Listing Combinatorial Structures Leslie Ann Goldberg

Efficient Algorithms for Listing Combinatorial Structures

Język: Angielski
Oprawa: Twarda
Dostępność: Dostępna u dostawcy
Wysyłamy za 9-15 dni
605.45
First published in 1993, this thesis is concerned with the design of efficient algorithms for listin...

Informacje o książce

Język
Angielski
Oprawa
Książka - Twarda
Data wydania
1993
strony
178
EAN
9780521450218
ISBN
0521450217
Enbook ID
02031294
Waga
49
Wymiary
170 x 244 x 11

Pełny opis

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.

Możesz być zainteresowany

Ethics and Science

Adam BriggleCarl Mitcham
507.61
98.91
31.44
253.90
80.02
142.03
240.27

Agents Provocateurs

Sebastien Carayol
133.76

Dynamic Modeling

Bruce Hannon
455.62

Klienci, którzy kupili tę książkę, kupili również

98.52

Verschwender

Ferdinand Raimund
48.09
14.59

HISTORIA DEL CINE

JOSE LUIS SANCHEZ NORIEGA
163.26

EL MALEFICIO DE LA PRINCESA

ANTONIO A. GOMEZ YEBRA
61.03