グラフの1ー因子分解を利用した最適スケジューリングアルゴリズム

機関リポジトリ HANDLE Web Site

書誌事項

タイトル別名
  • Optimal Scheduling Algorithms by 1-factorizations of Graphs
  • グラフ ノ 1―インシ ブンカイ オ リヨウ シタ サイテキ スケジューリング アルゴリズム

この論文をさがす

説明

application/pdf

論文(Article)

The scheduling problem of a round-robin pairing is: Given some positive integer n and some restricted condition C, make a schedule of a round-robin pairing with n teams satisfying the condition C. If the problem is solved by human powers, we can find the following two troubles: (1) If n is very large, it costs the author infinite labor. (2 ) The fairness is not always secured. In this paper, we consider several variations of the scheduling problem of a round-robin pairing, and, by using the I-factorizations of complete graphs or complete directed graphs, we give optimal algorithms for solving the problem by using a computer.

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ