Efficient Algorithms for Listing Combinatorial Structures pdf epub mobi txt 電子書下載2025

簡體網頁||繁體網頁

☆☆☆☆☆

出版者:

作者:Goldberg, Leslie Ann

出品人:

頁數:180

译者:

出版時間:2009-7

價格:$ 50.85

裝幀:

isbn號碼:9780521117883

叢書系列:

圖書標籤:

計算機科學
for
Structures
Programming
Listing
Efficient
Combinatorial
Algorithms

下載連結在頁面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製連結

想要找書就要到圖書目錄大全

book.wenda123.org

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

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.