Kniha Efficient Algorithms for Listing Combinatorial Structures Leslie Ann Goldberg

Efficient Algorithms for Listing Combinatorial Structures

Jazyk: Angličtina
Vazba: Pevná
Dostupnost: Skladem u dodavatele
Odesíláme za 9-15 dnů
3 296
First published in 1993, this thesis is concerned with the design of efficient algorithms for listin...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
1993
Stránek
178
EAN
9780521450218
ISBN
0521450217
Enbook ID
02031294
Hmotnost
49
Rozměry
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 zajímat

Ethics and Science

Adam BriggleCarl Mitcham
2 764
537
171
1 385
778
1 310

Agents Provocateurs

Sebastien Carayol
763

Dynamic Modeling

Bruce Hannon
2 457

Zákaznicí kteří koupili tuto knihu koupili také

502

Verschwender

Ferdinand Raimund
259
87

HISTORIA DEL CINE

JOSE LUIS SANCHEZ NORIEGA
932

EL MALEFICIO DE LA PRINCESA

ANTONIO A. GOMEZ YEBRA
329