Random Generating k-connected Graphs

Random Generating k-connected Graphs

碩士 === 國立清華大學 === 資訊工程學系 === 95 === Enumerating combinatorial objects is an important research topic in combinatorics. Algorithms for random generating combinatorial objects are called sampling. Sampling has many applications in computer science, for example program testing. Mathematicians can use s...

Full description

Bibliographic Details
Main Authors: Yu-Han Lyu, 呂昱翰
Other Authors: Chuan-Yi Tang
Format: Others
Language:en_US
Published: 2007
Online Access:http://ndltd.ncl.edu.tw/handle/21237074229415401785
id ndltd-TW-095NTHU5392017
record_format oai_dc
spelling ndltd-TW-095NTHU53920172015-10-13T14:08:38Z http://ndltd.ncl.edu.tw/handle/21237074229415401785 Random Generating k-connected Graphs 隨機產生k連通圖形 Yu-Han Lyu 呂昱翰 碩士 國立清華大學 資訊工程學系 95 Enumerating combinatorial objects is an important research topic in combinatorics. Algorithms for random generating combinatorial objects are called sampling. Sampling has many applications in computer science, for example program testing. Mathematicians can use sampling to verify combinatorial property. We developed a simple algorithm to sample k-connected graphs based on Markov Chain Monte Carlo method. This algorithm generates graphs at approximately uniform distribution, and we prove it is rapidly mixing Chuan-Yi Tang 唐傳義 2007 學位論文 ; thesis 21 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立清華大學 === 資訊工程學系 === 95 === Enumerating combinatorial objects is an important research topic in combinatorics. Algorithms for random generating combinatorial objects are called sampling. Sampling has many applications in computer science, for example program testing. Mathematicians can use sampling to verify combinatorial property. We developed a simple algorithm to sample k-connected graphs based on Markov Chain Monte Carlo method. This algorithm generates graphs at approximately uniform distribution, and we prove it is rapidly mixing
author2 Chuan-Yi Tang
author_facet Chuan-Yi Tang
Yu-Han Lyu
呂昱翰
author Yu-Han Lyu
呂昱翰
spellingShingle Yu-Han Lyu
呂昱翰
Random Generating k-connected Graphs
author_sort Yu-Han Lyu
title Random Generating k-connected Graphs
title_short Random Generating k-connected Graphs
title_full Random Generating k-connected Graphs
title_fullStr Random Generating k-connected Graphs
title_full_unstemmed Random Generating k-connected Graphs
title_sort random generating k-connected graphs
publishDate 2007
url http://ndltd.ncl.edu.tw/handle/21237074229415401785
work_keys_str_mv AT yuhanlyu randomgeneratingkconnectedgraphs
AT lǚyùhàn randomgeneratingkconnectedgraphs
AT yuhanlyu suíjīchǎnshēngkliántōngtúxíng
AT lǚyùhàn suíjīchǎnshēngkliántōngtúxíng
_version_ 1717749930457563136

Similar Items