{"updated":"2025-01-20T07:33:30.011040+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00172941","sets":["1164:1579:8444:8870"]},"path":["8870"],"owner":"11","recid":"172941","title":["トーラスに規則的に辺を追加した直径および平均パス長最小のグラフ"],"pubdate":{"attribute_name":"公開日","attribute_value":"2016-08-01"},"_buckets":{"deposit":"1561c396-083e-4fe7-b4c7-70d274e9a409"},"_deposit":{"id":"172941","pid":{"type":"depid","value":"172941","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"トーラスに規則的に辺を追加した直径および平均パス長最小のグラフ","author_link":["352336","352337","352334","352335"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"トーラスに規則的に辺を追加した直径および平均パス長最小のグラフ"},{"subitem_title":"Regularly Edge-added Torus Graphs with the Minimum Diameter and the Minimum Average Shortest Path Length","subitem_title_language":"en"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"ネットワーク・グラフ","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2016-08-01","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大阪府立大学大学院理学系研究科"},{"subitem_text_value":"大阪府立大学大学院工学研究科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Graduate School of Science Osaka Prefecture University","subitem_text_language":"en"},{"subitem_text_value":"Graduate School of Engineering Osaka Prefecture University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/172941/files/IPSJ-ARC16221045.pdf","label":"IPSJ-ARC16221045.pdf"},"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-ARC16221045.pdf","filesize":[{"value":"579.8 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"16"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_login","version_id":"61226c4e-8167-41d5-b22a-687d802991f0","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2016 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"小林, 寛之"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"藤本, 典幸"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hiroyuki, Kobayashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Noriyuki, Fujimoto","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10096105","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8574","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"近年のマルチコアプロセッサがもつコア数は年々増加しており，それらすべてを相互に接続することは現実的ではない．そこでコア間を接続するネットワークのトポロジに関する様々な問題が研究されている．そのような問題のひとつに，与えられた頂点数と最大次数を持つすべてのグラフの中で直径および平均パス長が最小のグラフを見つける問題 (Ordeｒ/Degree問題） がある．本論文では与えられた頂点数と最大次数を満たす範囲でトーラスの各頂点に辺を規則的に追加し，そのようなグラフの中で直径および平均パス長が最小となるものをすべて列挙するアルゴリズムを提案する．またそれを用いて発見した Order/Degree 問題の最適解となるグラフを報告する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"It is not realistic to connect all of cores in a multicore-processor each other because current multicore-processors have many cores. Therefore there are many studies about network topologies to connect cores. The order/degree problem is one of the tackled problems. It finds graphs with the minimum diameter and the minimum average shortest path length (ASPL) over all graphs for a given number n of vertices and a given degree deg. We present an algorithm to enumerate all of graphs with the minimum diameter and the minimum ASPL over all graphs such that each vertex of torus with n vertices is added edges regularly within degree deg. Also we report optimal graphs for the order/degree problem found by our algorithm.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告システム・アーキテクチャ（ARC）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2016-08-01","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"45","bibliographicVolumeNumber":"2016-ARC-221"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"created":"2025-01-19T00:43:17.209064+00:00","id":172941,"links":{}}