Contacto
Cómo comprar
Entrega
Guía de compras
Efficient Algorithms for Listing Combinatorial Structures
Inglés
137 b
Política de devolución de 30 días
Clientes que también han comprado
/
binding.
33.79
€
/
Tapa blanda
17.89
€
/
Tapa blanda
17.89
€
/
Tapa blanda
49.19
€
/
Tapa blanda
31.29
€
/
Tapa blanda
22.79
€
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.
Sobre el libro
Inglés
Regale este libro hoy
Es fácil
1 Añadir al carrito y elegir Entregar como regalo en el checkout 2 Le enviaremos un vale 3 El libro llegará a la dirección del destinatarioTambién puede interesarle
/
Tapa blanda
80.19
€
/
Tapa blanda
24.79
€
/
Tapa blanda
10.69
€
/
Tapa dura
104.39
€
/
Tapa dura
22.69
€
/
Tapa dura
242.69
€