Algorithms of Determining any Perfect Matching Mi of Kv

Abstract:

Article Preview

A definition about edge-matrix is given. Two algorithms for solving perfect matching are obtained. Algorithms A is that perfect matching is determined by using edge coloring of edge-matrix ; Algorithm B is that perfect matching is determined by partitioning edge-matrix into sub matrix and also by solving perfect matching of a complete graph .The procedure of constructing round-robin tournament by using algorithm A and round-robin tournament by using algorithm B.

Info:

Periodical:

Edited by:

Zhixiang Hou

Pages:

170-173

DOI:

10.4028/www.scientific.net/AMM.48-49.170

Citation:

Z. D. Xu et al., "Algorithms of Determining any Perfect Matching Mi of Kv", Applied Mechanics and Materials, Vols. 48-49, pp. 170-173, 2011

Online since:

February 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.