Construction of basic match schedules for sports competitions by using graph theory

Arjan van Weert, Jan A.M. Schreuder

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

7 Citations (Scopus)

Abstract

Basic Match Schedules are important for constructing sports timetables. Firstly these schedules guarantee the fairness of the sports competitions and secondly they reduce the complexity of the problem. This paper presents an approach to the problem of finding Basic Match Schedules for sports competitions. The approach is clarified by applying it to the Dutch volleyball competition. By using graph representation and theory this approach has the potential to classify sports competitions and to build libraries with Basic Match Schedules for each class of sports competitions. As an example we present an overview of some Basic Match Schedules for the volleyball competition.
Original languageEnglish
Title of host publicationPractice and Theory of Automated Timetabling II
EditorsEdmund Burke, Michael Carter
Place of PublicationBerlin, Germany
PublisherSpringer
Pages201-210
ISBN (Print)3-540-64979-4
DOIs
Publication statusPublished - 20 Aug 1997
Event2nd International Conference on the Practice and Theory of Automated Timetabling, PATAT 1997 - Toronto, Canada
Duration: 20 Aug 199722 Aug 1997
Conference number: 2
http://patatconference.org/patat1997/

Publication series

NameLecture notes in computer science
PublisherSpringer
Volume1408
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on the Practice and Theory of Automated Timetabling, PATAT 1997
Abbreviated titlePATAT 1997
CountryCanada
CityToronto
Period20/08/9722/08/97
Internet address

Fingerprint Dive into the research topics of 'Construction of basic match schedules for sports competitions by using graph theory'. Together they form a unique fingerprint.

Cite this