Graph factorization and hamilton path based balanced tournament design
| dc.contributor.author | Desh Deepak, Pathak | |
| dc.contributor.supervisor | Kumar, Ravinder | |
| dc.date.accessioned | 2013-08-02T12:26:37Z | |
| dc.date.available | 2013-08-02T12:26:37Z | |
| dc.date.issued | 2013-08-02T12:26:37Z | |
| dc.description | Master of Engineering (Software Engineering) | en |
| dc.description.abstract | A Hamilton path tournament design is based on round-robin tournament. For n teams, It takes (n 1) days and each team plays in each stadium not more than twice. Moreover, the set of matches played in each stadium forms a Hamilton path. Formerly, an inductive proof has been given for the construction of Hamilton path tournament designs. It was shown for n = 2p 8(p 3). Here, I provide an algorithmic proof which constructs Hamilton path tournament designs for n = 2 p 8(p 3) teams. It completes the inductive proof for practical means. | en |
| dc.description.sponsorship | Computer Science and Engineering Department, Thapar University, Patiala | en |
| dc.format.extent | 896596 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10266/2235 | |
| dc.language.iso | en | en |
| dc.subject | 1-factor | en |
| dc.subject | Balanced tourmament | en |
| dc.subject | hamilton path | en |
| dc.title | Graph factorization and hamilton path based balanced tournament design | en |
| dc.type | Thesis | en |