libcats.org
Главная

Efficient algorithms for listing combinatorial structures

Обложка книги Efficient algorithms for listing combinatorial structures

Efficient algorithms for listing combinatorial structures

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.
Популярные книги за неделю:

Ключ к сверхсознанию

Автор:
Категория: Путь к себе
Размер книги: 309 Kb

Древо жизни

Автор:
Категория: Путь к себе
Размер книги: 1.70 Mb

Contemporary Theatre, Film and Television, Volume 97

Автор:
Размер книги: 3.18 Mb

Шликерное литье

Автор:
Категория: science, science, technical
Размер книги: 5.98 Mb
Только что пользователи скачали эти книги:

ДВА ГОДА ДВИЖЕНИЯ

Автор:
Категория: Политика
Размер книги: 4.61 Mb

Ключ к сверхсознанию

Автор:
Категория: Путь к себе
Размер книги: 309 Kb

Franklin and Bache: Envisioning the Enlightened Republic

Автор:
Размер книги: 11.37 Mb

100 Years: The Australian Story

Автор:
Размер книги: 1.09 Mb

Courage of the Wolf

Автор:
Категория: fiction
Размер книги: 756 Kb

The Long Journey Home [from Frontier Christmas Anthology] [Anthology]

Автор:
Категория: fiction
Размер книги: 118 Kb