Tournament scoring problem

DOI10.1016/j.amc.2007.09.041zbMath1143.05037OpenAlexW2027130782MaRDI QIDQ924403

Hüseyin Pehlivan, Vasif V. Nabiyev

Publication date: 16 May 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.09.041

zbMATH Keywords

mixed graphsblack{\&}white graphsmulti-parameter partitionvertex chaining

Mathematics Subject Classification ID

Applications of graph theory (05C90) (n)-person games, (n>2) (91A06) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Determining the results of tournament games using complete graphs generation

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• An algorithm to generate tournament score sequences
• Global constraints for round robin tournament scheduling.
• Scheduling a round robin tennis tournament under courts and players availability constraints
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• Scheduling the professional soccer leagues of Austria and Germany
• Scheduling a Major College Basketball Conference—Revisited
• Allocating Games for the NHL Using Integer Programming
• Enumeration of Mixed Graphs
• A tournament problem

This page was built for publication: Tournament scoring problem