{"created":"2023-05-15T12:31:07.712080+00:00","id":688,"links":{},"metadata":{"_buckets":{"deposit":"9633b482-705d-4c46-878c-b37bcc1a22d5"},"_deposit":{"created_by":6,"id":"688","owners":[6],"pid":{"revision_id":0,"type":"depid","value":"688"},"status":"published"},"_oai":{"id":"oai:fit.repo.nii.ac.jp:00000688","sets":["256:257:366"]},"author_link":["3217","3219","3218"],"item_3_alternative_title_23":{"attribute_name":"タイトル（ヨミ）","attribute_value_mlt":[{"subitem_alternative_title":"グラフ ノ 1―インシ ブンカイ オ リヨウ シタ サイテキ スケジューリング アルゴリズム"}]},"item_3_biblio_info_6":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1999-03-15","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicPageEnd":"231","bibliographicPageStart":"217","bibliographicVolumeNumber":"31","bibliographic_titles":[{"bibliographic_title":"福岡工業大学研究論集"},{"bibliographic_title":"RESEARCH BULLETIN OF FUKUOKA INSTITUTE OF TECHNOLOGY","bibliographic_titleLang":"en"}]}]},"item_3_description_17":{"attribute_name":"フォーマット","attribute_value_mlt":[{"subitem_description":"application/pdf","subitem_description_type":"Other"}]},"item_3_description_47":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"subitem_description":"論文(Article)","subitem_description_type":"Other"}]},"item_3_description_5":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"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:\n(1) If n is very large, it costs the author infinite labor. \n(2 ) The fairness is not always secured.\nIn 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. \n","subitem_description_type":"Other"}]},"item_3_full_name_2":{"attribute_name":"著者(ヨミ)","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"3218","nameIdentifierScheme":"WEKO"}],"names":[{"name":"タカハシ, マサヤ"}]}]},"item_3_full_name_3":{"attribute_name":"別言語の著者","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"3219","nameIdentifierScheme":"WEKO"}],"names":[{"name":"TAKAHASHI, Masaya"}]}]},"item_3_publisher_37":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"福岡工業大学"}]},"item_3_source_id_7":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"02876620","subitem_source_identifier_type":"ISSN"}]},"item_3_text_38":{"attribute_name":"出版者（ヨミ）","attribute_value_mlt":[{"subitem_text_value":"フクオカ コウギョウ ダイガク"}]},"item_3_text_39":{"attribute_name":"別言語の出版者","attribute_value_mlt":[{"subitem_text_value":"Fukuoka Institute of Technology"}]},"item_3_text_48":{"attribute_name":"資源タイプ・ローカル","attribute_value_mlt":[{"subitem_text_value":"紀要論文"}]},"item_3_text_49":{"attribute_name":"資源タイプ・NII","attribute_value_mlt":[{"subitem_text_value":"Departmental Bulletin Paper"}]},"item_3_text_50":{"attribute_name":"資源タイプ・DCMI","attribute_value_mlt":[{"subitem_text_value":"text"}]},"item_3_text_51":{"attribute_name":"資源タイプ・ローカル表示コード","attribute_value_mlt":[{"subitem_text_value":"02"}]},"item_3_version_type_19":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_970fb48d4fbd8a85","subitem_version_type":"VoR"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"高橋, 昌也"}],"nameIdentifiers":[{"nameIdentifier":"3217","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","displaytype":"detail","filename":"31(2)-217.pdf","filesize":[{"value":"1.0 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://fit.repo.nii.ac.jp/record/688/files/31(2)-217.pdf"},"version_id":"5aef4cf4-6c49-45ea-827f-5756bc7f087d"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"round-robin","subitem_subject_scheme":"Other"},{"subitem_subject":"home and away","subitem_subject_scheme":"Other"},{"subitem_subject":"scheduling","subitem_subject_scheme":"Other"},{"subitem_subject":"comp lete graph","subitem_subject_scheme":"Other"},{"subitem_subject":"I-factorization","subitem_subject_scheme":"Other"},{"subitem_subject":"restricted conditions","subitem_subject_scheme":"Other"},{"subitem_subject_scheme":"Other"},{"subitem_subject":"round-robin","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"home and away","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"scheduling","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"comp lete graph","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"I-factorization","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject":"restricted conditions","subitem_subject_language":"en","subitem_subject_scheme":"Other"},{"subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"グラフの1ー因子分解を利用した最適スケジューリングアルゴリズム","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"グラフの1ー因子分解を利用した最適スケジューリングアルゴリズム"},{"subitem_title":"Optimal Scheduling Algorithms by 1-factorizations of Graphs","subitem_title_language":"en"}]},"item_type_id":"3","owner":"6","path":["366"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-02-25"},"publish_date":"2021-02-25","publish_status":"0","recid":"688","relation_version_is_last":true,"title":["グラフの1ー因子分解を利用した最適スケジューリングアルゴリズム"],"weko_creator_id":"6","weko_shared_id":-1},"updated":"2023-05-15T13:39:22.534355+00:00"}