RECONSTRUCTION OF TOURNAMENTS,
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 Ulam's problem, by analogy with one in undirected graphs was studied by Harary and Palmer; this paper contains all necessary background. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1967
- Accession Number
- AD0678647
Entities
People
- E. T. Parker
Organizations
- University of Illinois Urbana–Champaign