Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Efficient Algorithms for Listing Combinatorial Structures
Engleski
131 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
binding.
33.72
€
/
Meki uvez
16.20
€
/
Meki uvez
16.20
€
/
Meki uvez
44.55
€
/
Meki uvez
30.27
€
/
Meki uvez
22.58
€
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.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
72.51
€
/
Meki uvez
23.89
€
/
Meki uvez
10.32
€
/
Tvrdi uvez
93.88
€
/
Tvrdi uvez
21.66
€
/
Tvrdi uvez
215.42
€