Contacto
Como comprar
Entrega
Guia de compras
Efficient Algorithms for Listing Combinatorial Structures
Inglês
113 b
Política de devolução de 30 dias
Os clientes também compraram
/
binding.
29.40
€
/
Capa mole
14.24
€
/
Capa mole
14.24
€
/
Capa mole
39.30
€
/
Capa mole
25.96
€
/
Livro de capa dura
18.18
€
/
Capa mole
19.19
€
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 o livro
Inglês
Ofereça este livro hoje
É fácil
1 Adicione ao carrinho e escolha Entregar como presente ao finalizar a compra 2 Receberá um vale 3 O livro chegará ao endereço do destinatárioTambém pode estar interessado em
/
Capa mole
65.07
€
/
Capa mole
20.20
€
/
Capa mole
8.68
€
/
Livro de capa dura
83.76
€
/
Livro de capa dura
17.57
€
/
Livro de capa dura
189.57
€