Optimization of Hamilton Path Tournament Schedule  

Abstract

A Hamilton path tournament design involving n teams and n/2 stadiums, is a round robin schedule on n − 1 days in which each team plays in each stadium at most twice, and the set of games played in each stadium induce a Hamilton path on n teams[1]. We have created an algorithm to calculate the cost of all pairs which is generated using Hamilton path tournament Design [1] that work on n teams, ,n/2 stadiums and n − 1 days schedule in which each team played at most twice in each stadium [1]. In our algorithm, we have calculated the cost of each combination of pairs and choose the Optimize Hamilton path tournament. 

Authors and Affiliations

Trinetra Kumar Pathak , Vinod Kumar Bhalla

Keywords

Related Articles

REVIEW OF PASSWORD PROTECTING MECHANISM 

In the online communication, the password has an important role to secure user personal details. These passwords are taken to be secure and it must be retain personally. The third person may take a password witho...

An Unobservable Secure Routing Protocol against Wormhole and Black hole Attacks in MANET. 

Mobile ad-hoc network (MANET) is a selfconfiguring infrastructure-less network of mobile devices. The sensitive information such as mobility behavior should be kept private from adversaries in wireless environments...

Detection Model for Daniel-of-Service Attacks using Random Forest and k-Nearest Neighbors 

Because of the increasing of networks’ speed and the amount of network traffic, it is essential that IDSs need to be lightweight to cope with it before classification. Feature selection has been successfully used t...

Implementation of Radix-4 Multiplier with a Parallel MAC unit using MBE Algorithm 

t— A radix-4/-8 multiplier is implemented using modified booth multiplier encoder that demand high speed and low energy operation. Depending on the input pattern, the multiplier operates in the radix-8 mode in 56%...

RULE-BASE DATA MINING SYSTEMS FOR CUSTOMER QUERIES  

The main objective of this paper is to have a best association between customer and organization. This project is proposed in order to discover knowledge from huge amount of data and to use the data efficiently b...

Download PDF file
  • EP ID EP125782
  • DOI -
  • Views 83
  • Downloads 0

How To Cite

Trinetra Kumar Pathak, Vinod Kumar Bhalla (2013). Optimization of Hamilton Path Tournament Schedule  . International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 2(6), 2091-2094. https://europub.co.uk/articles/-A-125782