Accession Number:

AD0678647

Title:

RECONSTRUCTION OF TOURNAMENTS,

Descriptive Note:

Corporate Author:

ILLINOIS UNIV URBANA

Personal Author(s):

Report Date:

1967-01-01

Pagination or Media Count:

2.0

Abstract:

A tournament of order n is a complete graph of n nodes generally, n finite with each arc assigned a unique direction. A problem, sometimes called Ulams problem, by analogy with one in undirected graphs was studied by Harary and Palmer this paper contains all necessary background. Author

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE