Uniform Generation of d-Factors in Dense Host Graphs

作者：Gao Pu^*

来源：Graphs and Combinatorics, 2014, 30(3): 581-589.

DOI：10.1007/s00373-013-1284-1

• Uniform generation
• Enumeration
• d-factors
• Switching method

Given a constant integer d a parts per thousand yen 1 and a host graph H that is sufficiently dense, we lower bound the number of d-factors H contains. When the complement of H is sufficiently sparse, we provide an algorithm that uniformly generates the d-factors of H and we justify the efficiency of the algorithm.

• 出版日期2014-5