Algorithms of Determining any Perfect Matching Mi of Kv

Zhao Di Xu; Xiao Yi Li; Wan Xi Chou

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

Paper Titles

Adsorption and Photocatalytic Degradation of Methyl Orange on TiO₂ and CuZSM-5 Mixture
p.149

Adsorption Property and Photocatalytic Activity of Sol-Gel Prepared Porous TiO₂ Using PEG1000 as Template
p.153

AHP to Appraise the Traffic Safety of the Express Way
p.157

Algorithm Based on Multiple Features for Recognition of E.coli Promoter Region
p.164

Algorithms of Determining any Perfect Matching M_i of K_v
p.170

An Adaptive Variational PDE Based Image Restoration Model Using Hopfield Neural Network
p.174

An Analysis on Risk Factors of High Risk Operations in Hydroelectric Project
p.179

An Approach to Improving Performance of the dc Filter in HVDC Transmission System
p.183

An Attribute Reduction Algorithms of Expert System Knowledge Acquisition
p.187

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 48-49Algorithms of Determining any Perfect Matching Mi...

Algorithms of Determining any Perfect Matching M_i of K_v

Abstract:

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.

You might also be interested in these eBooks

Measuring Technology and Mechatronics Automation

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 48-49)

Pages:

170-173

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.48-49.170

Citation:

Cite this paper

Online since:

February 2011

Authors:

Zhao Di Xu, Xiao Yi Li, Wan Xi Chou

Keywords:

Algorithm (GA), Complete Graph, Edge Coloring, Edge Matrix, Perfect Matching

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Briskorn D, Drexl A, in: Scheduling sport leagues using branch-and-price. Operational Research Society, 2009, 60(1): 84-93.

DOI: 10.1057/palgrave.jors.2602515

Google Scholar

[2] Ryuhei Miyashiro, Tomomi Matsui, in: Minimizing the carry-over eﬀects value in a round robin tournament, Proceedings of the 6th International Conference on the Practice and Theory of Automated Timetabling, 2006: 402-405.

Google Scholar

[3] D de Werra, T Ekim, C Raess, in: Construction of sports schedules with multiple venues. Discrete Applied Mathematics, 2006, 154(1): 47-58.

DOI: 10.1016/j.dam.2005.03.011

Google Scholar

[4] Andreas Drexla, Sigrid Knustb, in: Sports league scheduling: graph and resource-based models. Omega, 2004, 35(5): 465-471.

DOI: 10.1016/j.omega.2005.08.002

Google Scholar

[5] Briskorn D, Drexl A, in: A branching scheme for finding cost-minimal round robin tournaments. Operational Research, 2009, 197(1): 68-76.

DOI: 10.1016/j.ejor.2008.06.008

Google Scholar

[6] Rasmussen RV, in: Scheduling a triple round Robin tournament for the best Danish soccer league. Operational Research, 2008, 185(2): 795-810.

DOI: 10.1016/j.ejor.2006.12.050

Google Scholar

[7] Ribeiro C C, Urrutia S, in: Scheduling the Brazilian soccer tournament with fairness and broadcast objectives. Proceedings of the 6th international conference on Practice and theory of automated timetabling VI 2007: 149-159.

DOI: 10.1007/978-3-540-77345-0_10

Google Scholar

[8] Thomas Bartscha, Andreas Drexlc, and Stefan Krögerd, in: Scheduling the professional soccer leagues of Austria and Germany, Computers and Operations Research, 2006, 33(7): 1907-(1937).

DOI: 10.1016/j.cor.2004.09.037

Google Scholar

[9] R V Rasmussen, M A Trick, in: A benders approach for the constrained minimum break problem. Operational Research, 2007, 177(1): 198-213.

DOI: 10.1016/j.ejor.2005.10.063

Google Scholar