portada Efficient Algorithms for Listing Combinatorial Structures Hardback (Distinguished Dissertations in Computer Science) (en Inglés)

Efficient Algorithms for Listing Combinatorial Structures Hardback (Distinguished Dissertations in Computer Science) (en Inglés)

Formato

Libro Físico

Autor

Leslie Ann Goldberg

Editorial

Cambridge University Press

Año

1993

Idioma

Inglés

N° páginas

178

Encuadernación

Tapa Dura

Dimensiones

24.4x17x1.1 cm

Peso

0.49 kg.

ISBN

0521450217

ISBN13

9780521450218

N° edición

Categorías

Matemáticas
Tecnología de la información: cuestiones generales

Efficient Algorithms for Listing Combinatorial Structures Hardback (Distinguished Dissertations in Computer Science) (en Inglés)

Leslie Ann Goldberg (Autor) · Cambridge University Press · Tapa Dura

Libro Nuevo Importado

Envío: 21 a 28 días háb.

$ 339.94$ 169.97

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 100 unidades

$ 169.97

Llega entre el 25 Sep y el 08 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Efficient Algorithms for Listing Combinatorial Structures Hardback (Distinguished Dissertations in Computer Science) (en Inglés)"

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 that are of interest to theoretical computer scientists and combinatorialists? Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colorable graphs. Some related work is also included that 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 Polya's cycle polynomial is demonstrated.