Kniha Efficient Algorithms for Listing Combinatorial Structures Leslie Ann Goldberg

Efficient Algorithms for Listing Combinatorial Structures

Jazyk: Angličtina
Väzba: Pevná
Dostupnosť: Skladom u dodávateľa
Odosielame za 9-15 dní
136.35
First published in 1993, this thesis is concerned with the design of efficient algorithms for listin...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Pevná
Vydalo
1993
Stránok
178
EAN
9780521450218
ISBN
0521450217
Enbook ID
02031294
Hmotnosť
49
Rozmery
170 x 244 x 11

Kompletný popis

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.

Mohlo by vás zaujímať

Ethics and Science

Adam BriggleCarl Mitcham
114.35
22.19
7.06
57.27
17.77
32.21
54.22

Agents Provocateurs

Sebastien Carayol
31.62

Dynamic Modeling

Bruce Hannon
107.57

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

23.39

Verschwender

Ferdinand Raimund
11.39
3.61

HISTORIA DEL CINE

JOSE LUIS SANCHEZ NORIEGA
38.60

EL MALEFICIO DE LA PRINCESA

ANTONIO A. GOMEZ YEBRA
14.43