Efficient Algorithms for Listing Combinatorial Structures pdf epub mobi txt 电子书下载 2024

☆☆☆☆☆
简体网页||繁体网页

Goldberg, Leslie Ann

2009-7

180

$ 50.85

9780521117883

图书标签: 计算机科学 for Structures Programming Listing Efficient Combinatorial Algorithms

喜欢 Efficient Algorithms for Listing Combinatorial Structures 的读者还喜欢

下载链接在页面底部

点击这里下载

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到小哈图书下载中心

qciss.net

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-06-28

Efficient Algorithms for Listing Combinatorial Structures epub 下载 mobi 下载 pdf 下载 txt 电子书下载 2024

Efficient Algorithms for Listing Combinatorial Structures pdf epub mobi txt 电子书下载 2024

图书描述

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 Polya's cycle polynomial is demonstrated.

Efficient Algorithms for Listing Combinatorial Structures 下载 mobi epub pdf txt 电子书