Efficient algorithms for listing combinatorial structures

＜図書＞
Efficient algorithms for listing combinatorial structures

責任表示	Leslie Ann Goldberg
シリーズ	Distinguished dissertations in computer science
データ種別	図書
出版情報	Cambridge : Cambridge University Press , 1993
本文言語	英語
大きさ	xv, 160 p. ; 26 cm
概要	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 comb...natorial 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. 続きを見る

状態	巻次	所蔵場所	請求記号	刷年	文庫名称	資料番号	コメント	予約・取寄	複写申込	自動書庫
		理系図自動書庫	101/GOL	1993		068252193008008		予約・取寄		出庫可能	予約・取寄		出庫可能

一般注記	Originally presented as Ph.D. thesis Bibliography: p. 155-160
著者標目	*Goldberg, Leslie Ann
分　類	DC20:005.73
書誌ID	1001060394
ISBN	0521450217
NCID	BA20964510
巻冊次	ISBN:0521450217
NBN	B9330169
登録日	2009.09.17
更新日	2009.09.17